Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Princeton, New Jersey :
Princeton University Press,
[2018]
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a22000007i 4500 | ||
|---|---|---|---|
| 001 | JSTOR_on1354949427 | ||
| 003 | OCoLC | ||
| 005 | 20231005004200.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 221215s2018 njua ob 001 0 eng d | ||
| 040 | |a JSTOR |b eng |e rda |e pn |c JSTOR |d EBLCP |d UKAHL |d OCLCQ |d DEGRU |d P@U |d N$T |d YDX |d OCLCO | ||
| 019 | |a 1373220548 | ||
| 020 | |a 9781400889846 |q (electronic bk.) | ||
| 020 | |a 1400889847 |q (electronic bk.) | ||
| 020 | |z 0691170665 | ||
| 020 | |z 9780691170664 | ||
| 029 | 1 | |a AU@ |b 000073197229 | |
| 035 | |a (OCoLC)1354949427 |z (OCoLC)1373220548 | ||
| 037 | |a 22573/ctv33p0g51 |b JSTOR | ||
| 050 | 4 | |a QA76 |b .M2146 2018eb | |
| 072 | 7 | |a COM |x 014000 |2 bisacsh | |
| 072 | 7 | |a COM |x 051300 |2 bisacsh | |
| 082 | 0 | 4 | |a 004 |2 23 |
| 084 | |a 54.15 |2 bcl | ||
| 049 | |a UAMI | ||
| 100 | 1 | |a MacCormick, John, |d 1972- |e author. | |
| 245 | 1 | 0 | |a What can be computed? : |b a practical guide to the theory of computation / |c John MacCormick. |
| 264 | 1 | |a Princeton, New Jersey : |b Princeton University Press, |c [2018] | |
| 264 | 4 | |c ©2018 | |
| 300 | |a 1 online resource (xix, 383 pages) : |b illustrations. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 504 | |a Includes bibliographical references (pages 373-374) and index. | ||
| 520 | |a 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. | ||
| 505 | 0 | |a 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?. | |
| 588 | 0 | |a Print version record. | |
| 590 | |a JSTOR |b Books at JSTOR All Purchased | ||
| 590 | |a JSTOR |b Books at JSTOR Demand Driven Acquisitions (DDA) | ||
| 590 | |a JSTOR |b Books at JSTOR Evidence Based Acquisitions | ||
| 650 | 0 | |a Computer science. | |
| 650 | 0 | |a Computer science |x Philosophy. | |
| 650 | 0 | |a Computer science |x History. | |
| 650 | 2 | |a Electronic Data Processing | |
| 650 | 6 | |a Informatique. | |
| 650 | 6 | |a Informatique |x Philosophie. | |
| 650 | 6 | |a Informatique |x Histoire. | |
| 650 | 7 | |a MATHEMATICS |x Study & Teaching. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS / Computer Science |2 bisacsh | |
| 650 | 7 | |a Computer science |2 fast | |
| 650 | 7 | |a Computer science |x Philosophy |2 fast | |
| 650 | 7 | |a Computers and IT. |2 ukslc | |
| 655 | 7 | |a History |2 fast | |
| 776 | 0 | 8 | |i Print version: |a MacCormick, John, 1972- |t What can be computed? |d Princeton, New Jersey : Princeton University Press, [2018] |z 0691170665 |w (DLC) 2018935138 |w (OCoLC)1004947315 |
| 856 | 4 | 0 | |u https://jstor.uam.elogim.com/stable/10.2307/j.ctv33pb07s |z Texto completo |
| 938 | |a Project MUSE |b MUSE |n musev2_109720 | ||
| 938 | |a De Gruyter |b DEGR |n 9781400889846 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH34258152 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL7156618 | ||
| 938 | |a EBSCOhost |b EBSC |n 3501686 | ||
| 938 | |a YBP Library Services |b YANK |n 15041943 | ||
| 994 | |a 92 |b IZTAP | ||