Loading…
What can be computed? : a practical guide to the theory of computation /
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 fundam...
| Call Number: | Libro Electrónico |
|---|---|
| Main Author: | |
| Format: | Electronic eBook |
| Language: | Inglés |
| Published: |
Princeton, New Jersey :
Princeton University Press,
[2018]
|
| Subjects: | |
| Online Access: | Texto completo |
Table of Contents:
- Overview
- 1. Introduction: what can and cannot be computed?
- Part I: computability theory
- 2. What is a computer program?
- 3. Some impossible python programs
- 4. What is a computational problem?
- 5. Turing machines: the simplest computers
- 6. Universal computer programs: programs that can do anything
- 7. Reductions: how to prove a problem is hard
- 8. Nondeterminism: magic or reality?
- 9. Finite automata: computing with limited resources
- Part II: computational complexity theory
- 10. Complexity theory: when efficiency does matter
- 11. Poly and expo: the two most fundamental complexity classes
- 12. PolyCheck and NPoly: hard problems that are easy to identify
- 13. Polynomial-time mapping reductions: proving x is as easy as proving y
- 14. NP-completeness: most hard problems are equally hard
- Part III: origins and applications
- 15. The original Turing machine
- 16. You can't prove everything that's true
- 17. Karp's 21 problems
- 18. Conclusion: what will be computed?.