Automata and Computability - Dexter C. Kozen
-20% with code BOOKS
Shipping in 12-18 days
30-day return policy
The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the ... Full description
You May Also Like
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-20% with code BOOKS
In stock at our supplier
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-20% with code BOOKS
In stock at our supplier
TOP
AI Engineering: Building Applications with Foundation Models
-20% with code BOOKS
In stock at our supplier
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-20% with code BOOKS
In stock at our supplier
TOP
The Art of Game Design: A Book of Lenses
-20% with code BOOKS
In stock at our supplier
TOP
How To Think About AI: A Guide For The Perplexed
-20% with code BOOKS
In stock at our supplier
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-20% with code BOOKS
In stock at our supplier
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-20% with code BOOKS
In stock at our supplier
TOP
HBR Guide to Generative AI for Managers
-20% with code BOOKS
In stock at our supplier
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-20% with code BOOKS
In stock at our supplier
TOP
The Web Application Hacker's Handbook: Discovering and Exploiting Security Flaws
-20% with code BOOKS
In stock at our supplier
TOP
How Linux Works: What Every Superuser Should Know
-20% with code BOOKS
In stock at our supplier
TOP
Artificial Intelligence: A Modern Approach, Global Edition
-20% with code BOOKS
In stock at our supplier
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-20% with code BOOKS
In stock at our supplier
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-20% with code BOOKS
In stock at our supplier
TOP
Linux Basics for Hackers, 2nd Edition: Getting Started with Networking, Scripting, and Security in Kali
-20% with code BOOKS
In stock at our supplier
TOP
Mathematics for Machine Learning
Cheng Soon Ong, A. Aldo Faisal, Marc Peter Deisenroth
-20% with code BOOKS
In stock at our supplier
TOP
Designing Machine Learning Systems: An Iterative Process for Production-Ready Applications
-20% with code BOOKS
In stock at our supplier
Description
The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gödel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science.
More Information
| Author | Dexter C. Kozen |
|---|---|
| Publisher | Springer New York |
| Release year | 2012 |
| Cover type | Softcover |
| EAN | 9781461273097 |