A Mathematical Primer on Computability - João Rasga,Amilcar Sernadas,Cristina Sernadas
-35% koodilla BOOKS
Toimitus 15-21 arkipäivässä
30 päivän palautusoikeus
The book provides a self-contained introduction to computability theory for advanced undergraduate or early graduate students of mathematics and computer science. The technical material is illustrated with plenty of examples, problems with fully worked solutions as well as a range of proposed exercises. Part I is centered around fundamental computability notions and results, starting with the pillar concept ... Täydellinen kuvaus
Saatat myös pitää
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
How To Think About AI: A Guide For The Perplexed
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
AI Engineering: Building Applications with Foundation Models
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
How to Talk to AI: (And How Not To)
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
The Art of Game Design: A Book of Lenses
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
How Linux Works: What Every Superuser Should Know
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Hands-On Large Language Models: Language Understanding and Generation
Maarten Grootendorst, Jay Alammar
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Clean Architecture: A Craftsman's Guide to Software Structure and Design
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
World of Warcraft Chronicle, Volume 2
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Linux Basics for Hackers, 2nd Edition: Getting Started with Networking, Scripting, and Security in Kali
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Deep Learning: Foundations and Concepts
Christopher M. Bishop, Hugh Bishop
-35% koodilla BOOKS
Toimittajalla varastossa
Kuvaus
The book provides a self-contained introduction to computability theory for advanced undergraduate or early graduate students of mathematics and computer science. The technical material is illustrated with plenty of examples, problems with fully worked solutions as well as a range of proposed exercises. Part I is centered around fundamental computability notions and results, starting with the pillar concepts of computational model (an abstract high-level programming language), computable function, decidable and listable set, proper universal function, decision problem and the reduction technique for transferring decidability and listability properties. The essential results namely Rice's Theorem, Rice-Shapiro's Theorem, Rice-Shapiro-McNaughton-Myhill's Theorem as well as Rogers' Theorem and the Recursion Theorem are presented and illustrated. Many-to-one reducibility and many-to-one degrees are investigated. A short introduction to computation with oracles is also included. Computable as well as non-computable operators are introduced as well as monotonic and finitary operators. The relationship between them is discussed, in particular via Myhill-Shepherdson's Theorem. Kleene's Least Fixed Point Theorem is also presented. Finally, Part I terminates with a briefi ng on the Turing computational model, Turing reducibility and Turing degrees. Part II of the book concentrates on applications of computability in several areas namely in logic (undecidability of arithmetic, satisfiability in propositional logic, decidability in modal logic), Euclidean geometry, graphs and Kolmogorov complexity. Nevertheless no previous knowledge of these subjects is required. The essential details for understanding the applications are provided.
Lisätietoja
| Kirjoittaja | João Rasga, Amilcar Sernadas, Cristina Sernadas |
|---|---|
| Julkaisija | College Publications |
| Julkaisuvuosi | 2018 |
| Kannen tyyppi | Pehmeäkantinen |
| EAN | 9781848902961 |