What Can Be Computed?

What Can Be Computed?
Author :
Publisher : Princeton University Press
Total Pages : 404
Release :
ISBN-10 : 9780691170664
ISBN-13 : 0691170665
Rating : 4/5 (665 Downloads)

Book Synopsis What Can Be Computed? by : John MacCormick

Download or read book What Can Be Computed? written by John MacCormick and published by Princeton University Press. This book was released on 2018-05-01 with total page 404 pages. Available in PDF, EPUB and Kindle. Book excerpt: An accessible and rigorous textbook for introducing undergraduates to computer science theory What Can Be Computed? is a uniquely accessible yet rigorous introduction to the most profound ideas at the heart of computer science. Crafted specifically for undergraduates who are studying the subject for the first time, and requiring minimal prerequisites, the book focuses on the essential fundamentals of computer science theory and features a practical approach that uses real computer programs (Python and Java) and encourages active experimentation. It is also ideal for self-study and reference. The book covers the standard topics in the theory of computation, including Turing machines and finite automata, universal computation, nondeterminism, Turing and Karp reductions, undecidability, time-complexity classes such as P and NP, and NP-completeness, including the Cook-Levin Theorem. But the book also provides a broader view of computer science and its historical development, with discussions of Turing's original 1936 computing machines, the connections between undecidability and Gödel's incompleteness theorem, and Karp's famous set of twenty-one NP-complete problems. Throughout, the book recasts traditional computer science concepts by considering how computer programs are used to solve real problems. Standard theorems are stated and proven with full mathematical rigor, but motivation and understanding are enhanced by considering concrete implementations. The book's examples and other content allow readers to view demonstrations of—and to experiment with—a wide selection of the topics it covers. The result is an ideal text for an introduction to the theory of computation. An accessible and rigorous introduction to the essential fundamentals of computer science theory, written specifically for undergraduates taking introduction to the theory of computation Features a practical, interactive approach using real computer programs (Python in the text, with forthcoming Java alternatives online) to enhance motivation and understanding Gives equal emphasis to computability and complexity Includes special topics that demonstrate the profound nature of key ideas in the theory of computation Lecture slides and Python programs are available at whatcanbecomputed.com


What Can Be Computed? Related Books

What Can Be Computed?
Language: en
Pages: 404
Authors: John MacCormick
Categories: Computers
Type: BOOK - Published: 2018-05-01 - Publisher: Princeton University Press

DOWNLOAD EBOOK

An accessible and rigorous textbook for introducing undergraduates to computer science theory What Can Be Computed? is a uniquely accessible yet rigorous introd
Computational Complexity
Language: en
Pages: 609
Authors: Sanjeev Arora
Categories: Computers
Type: BOOK - Published: 2009-04-20 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
Foundations of Computation
Language: en
Pages: 256
Authors: Carol Critchlow
Categories: Computers
Type: BOOK - Published: 2011 - Publisher:

DOWNLOAD EBOOK

Foundations of Computation is a free textbook for a one-semester course in theoretical computer science. It has been used for several years in a course at Hobar
Nine Algorithms That Changed the Future
Language: en
Pages: 232
Authors: John MacCormick
Categories: Computers
Type: BOOK - Published: 2020-09-15 - Publisher: Princeton University Press

DOWNLOAD EBOOK

Nine revolutionary algorithms that power our computers and smartphones Every day, we use our computers to perform remarkable feats. A simple web search picks ou
The Nature of Computation
Language: en
Pages: 1498
Authors: Cristopher Moore
Categories: Science
Type: BOOK - Published: 2011-08-11 - Publisher: OUP Oxford

DOWNLOAD EBOOK

Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to bi