Document detail
-
The permalink has been copied, you can use it immediately.
Just press Ctrl+v keys to put it where you prefer. - Print title
What can be computed? : a practical guide to the theory of computation
Abstract
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 (Fonte: editore)
- Find it at
- Details
Library
Document available
Borrowing request
Document available for loan
Shelfmark
DID 004.03 MACCJ
Notes
1 v.
Document available for loan
Shelfmark
DID 004.03 MACCJ a
Notes
1 v.