What can be computed? : a practical guide to the theory of computation (Record no. 30584)

000 -LEADER
fixed length control field a
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 220103b xxu||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780691170664
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004
Item number MAC
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name MacCormick, John
245 ## - TITLE STATEMENT
Title What can be computed? : a practical guide to the theory of computation
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Name of publisher, distributor, etc Princeton University Press,
Date of publication, distribution, etc 2018
Place of publication, distribution, etc Princeton :
300 ## - PHYSICAL DESCRIPTION
Extent xix, 383 p. ;
Other physical details ill.,
Dimensions 27 cm
365 ## - TRADE PRICE
Price amount 85.00
Price type code USD
Unit of pricing 78.20
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibliographical references and index.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science
Topical term or geographic name as entry element Computer science, Philosophy
Topical term or geographic name as entry element Computer science, History
Topical term or geographic name as entry element Computers and IT
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Permanent location Current location Date acquired Cost, normal purchase price Full call number Barcode Date last seen Koha item type
          DAIICT DAIICT 2021-12-31 6647.00 004 MAC 032740 2022-01-03 Books

Powered by Koha