What Can Be Computed?: A Practical Guide to the Theory of Computation
An accessible and rigorous textbook for introducing undergraduates to computer science theoryWhat 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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Princeton, NJ
Princeton University Press
[2018]
|
| Schlagworte: | |
| Online-Zugang: | DE-1046 DE-1043 DE-858 DE-859 DE-860 DE-739 Volltext |
| Zusammenfassung: | An accessible and rigorous textbook for introducing undergraduates to computer science theoryWhat 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 computationFeatures a practical, interactive approach using real computer programs (Python in the text, with forthcoming Java alternatives online) to enhance motivation and understandingGives equal emphasis to computability and complexityIncludes special topics that demonstrate the profound nature of key ideas in the theory of computationLecture slides and Python programs are available at whatcanbecomputed.com |
| Beschreibung: | Description based on online resource; title from PDF title page (publisher's Web site, viewed 27. Jan 2023) |
| Beschreibung: | 1 Online-Ressource (408 pages) 69 b/w illus., 13 tables |
| ISBN: | 9781400889846 |
| DOI: | 10.1515/9781400889846 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV048828692 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 230224s2018 xx a||| o|||| 00||| eng d | ||
| 020 | |a 9781400889846 |9 978-1-4008-8984-6 | ||
| 024 | 7 | |a 10.1515/9781400889846 |2 doi | |
| 035 | |a (ZDB-23-DGG)9781400889846 | ||
| 035 | |a (OCoLC)1371314896 | ||
| 035 | |a (DE-599)BVBBV048828692 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1043 |a DE-1046 |a DE-858 |a DE-859 |a DE-860 |a DE-739 | ||
| 082 | 0 | |a 004 |2 23 | |
| 100 | 1 | |a MacCormick, John |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a What Can Be Computed? |b A Practical Guide to the Theory of Computation |c John MacCormick |
| 264 | 1 | |a Princeton, NJ |b Princeton University Press |c [2018] | |
| 264 | 4 | |c © 2018 | |
| 300 | |a 1 Online-Ressource (408 pages) |b 69 b/w illus., 13 tables | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Description based on online resource; title from PDF title page (publisher's Web site, viewed 27. Jan 2023) | ||
| 520 | |a An accessible and rigorous textbook for introducing undergraduates to computer science theoryWhat 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. | ||
| 520 | |a 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. | ||
| 520 | |a 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 computationFeatures a practical, interactive approach using real computer programs (Python in the text, with forthcoming Java alternatives online) to enhance motivation and understandingGives equal emphasis to computability and complexityIncludes special topics that demonstrate the profound nature of key ideas in the theory of computationLecture slides and Python programs are available at whatcanbecomputed.com | ||
| 546 | |a In English | ||
| 650 | 7 | |a COMPUTERS / Computer Science |2 bisacsh | |
| 650 | 4 | |a Computer science |x History | |
| 650 | 4 | |a Computer science |x Philosophy | |
| 650 | 4 | |a Computer science | |
| 856 | 4 | 0 | |u https://doi.org/10.1515/9781400889846?locatt=mode:legacy |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-23-DGG | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-034094279 | |
| 966 | e | |u https://doi.org/10.1515/9781400889846?locatt=mode:legacy |l DE-1046 |p ZDB-23-DGG |q FAW_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9781400889846?locatt=mode:legacy |l DE-1043 |p ZDB-23-DGG |q FAB_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9781400889846?locatt=mode:legacy |l DE-858 |p ZDB-23-DGG |q FCO_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9781400889846?locatt=mode:legacy |l DE-859 |p ZDB-23-DGG |q FKE_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9781400889846?locatt=mode:legacy |l DE-860 |p ZDB-23-DGG |q FLA_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9781400889846?locatt=mode:legacy |l DE-739 |p ZDB-23-DGG |q UPA_PDA_DGG |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1824508182786998272 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | MacCormick, John |
| author_facet | MacCormick, John |
| author_role | aut |
| author_sort | MacCormick, John |
| author_variant | j m jm |
| building | Verbundindex |
| bvnumber | BV048828692 |
| collection | ZDB-23-DGG |
| ctrlnum | (ZDB-23-DGG)9781400889846 (OCoLC)1371314896 (DE-599)BVBBV048828692 |
| dewey-full | 004 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004 |
| dewey-search | 004 |
| dewey-sort | 14 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1515/9781400889846 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zc 4500</leader><controlfield tag="001">BV048828692</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">230224s2018 xx a||| o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400889846</subfield><subfield code="9">978-1-4008-8984-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400889846</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-23-DGG)9781400889846</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1371314896</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV048828692</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1043</subfield><subfield code="a">DE-1046</subfield><subfield code="a">DE-858</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">MacCormick, John</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">What Can Be Computed?</subfield><subfield code="b">A Practical Guide to the Theory of Computation</subfield><subfield code="c">John MacCormick</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ</subfield><subfield code="b">Princeton University Press</subfield><subfield code="c">[2018]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2018</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (408 pages)</subfield><subfield code="b">69 b/w illus., 13 tables</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 27. Jan 2023)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">An accessible and rigorous textbook for introducing undergraduates to computer science theoryWhat 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.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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 computationFeatures a practical, interactive approach using real computer programs (Python in the text, with forthcoming Java alternatives online) to enhance motivation and understandingGives equal emphasis to computability and complexityIncludes special topics that demonstrate the profound nature of key ideas in the theory of computationLecture slides and Python programs are available at whatcanbecomputed.com</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Computer Science</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield><subfield code="x">History</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield><subfield code="x">Philosophy</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9781400889846?locatt=mode:legacy</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DGG</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-034094279</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9781400889846?locatt=mode:legacy</subfield><subfield code="l">DE-1046</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FAW_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9781400889846?locatt=mode:legacy</subfield><subfield code="l">DE-1043</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FAB_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9781400889846?locatt=mode:legacy</subfield><subfield code="l">DE-858</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FCO_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9781400889846?locatt=mode:legacy</subfield><subfield code="l">DE-859</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FKE_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9781400889846?locatt=mode:legacy</subfield><subfield code="l">DE-860</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FLA_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9781400889846?locatt=mode:legacy</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">UPA_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV048828692 |
| illustrated | Illustrated |
| index_date | 2024-07-03T21:35:11Z |
| indexdate | 2025-02-19T17:36:33Z |
| institution | BVB |
| isbn | 9781400889846 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-034094279 |
| oclc_num | 1371314896 |
| open_access_boolean | |
| owner | DE-1043 DE-1046 DE-858 DE-859 DE-860 DE-739 |
| owner_facet | DE-1043 DE-1046 DE-858 DE-859 DE-860 DE-739 |
| physical | 1 Online-Ressource (408 pages) 69 b/w illus., 13 tables |
| psigel | ZDB-23-DGG ZDB-23-DGG FAW_PDA_DGG ZDB-23-DGG FAB_PDA_DGG ZDB-23-DGG FCO_PDA_DGG ZDB-23-DGG FKE_PDA_DGG ZDB-23-DGG FLA_PDA_DGG ZDB-23-DGG UPA_PDA_DGG |
| publishDate | 2018 |
| publishDateSearch | 2018 |
| publishDateSort | 2018 |
| publisher | Princeton University Press |
| record_format | marc |
| spelling | MacCormick, John Verfasser aut What Can Be Computed? A Practical Guide to the Theory of Computation John MacCormick Princeton, NJ Princeton University Press [2018] © 2018 1 Online-Ressource (408 pages) 69 b/w illus., 13 tables txt rdacontent c rdamedia cr rdacarrier Description based on online resource; title from PDF title page (publisher's Web site, viewed 27. Jan 2023) An accessible and rigorous textbook for introducing undergraduates to computer science theoryWhat 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 computationFeatures a practical, interactive approach using real computer programs (Python in the text, with forthcoming Java alternatives online) to enhance motivation and understandingGives equal emphasis to computability and complexityIncludes special topics that demonstrate the profound nature of key ideas in the theory of computationLecture slides and Python programs are available at whatcanbecomputed.com In English COMPUTERS / Computer Science bisacsh Computer science History Computer science Philosophy Computer science https://doi.org/10.1515/9781400889846?locatt=mode:legacy Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | MacCormick, John What Can Be Computed? A Practical Guide to the Theory of Computation COMPUTERS / Computer Science bisacsh Computer science History Computer science Philosophy Computer science |
| title | What Can Be Computed? A Practical Guide to the Theory of Computation |
| title_auth | What Can Be Computed? A Practical Guide to the Theory of Computation |
| title_exact_search | What Can Be Computed? A Practical Guide to the Theory of Computation |
| title_exact_search_txtP | What Can Be Computed? A Practical Guide to the Theory of Computation |
| title_full | What Can Be Computed? A Practical Guide to the Theory of Computation John MacCormick |
| title_fullStr | What Can Be Computed? A Practical Guide to the Theory of Computation John MacCormick |
| title_full_unstemmed | What Can Be Computed? A Practical Guide to the Theory of Computation John MacCormick |
| title_short | What Can Be Computed? |
| title_sort | what can be computed a practical guide to the theory of computation |
| title_sub | A Practical Guide to the Theory of Computation |
| topic | COMPUTERS / Computer Science bisacsh Computer science History Computer science Philosophy Computer science |
| topic_facet | COMPUTERS / Computer Science Computer science History Computer science Philosophy Computer science |
| url | https://doi.org/10.1515/9781400889846?locatt=mode:legacy |
| work_keys_str_mv | AT maccormickjohn whatcanbecomputedapracticalguidetothetheoryofcomputation |