How Long to Read What Can Be Computed?

How Long Does it Take to Read What Can Be Computed??

It takes the average reader 7 hours and 1 minute to read What Can Be Computed? by John MacCormick

Assuming a reading speed of 250 words per minute. Learn more

Description

An accessible and rigorous textbook for introducing undergraduates to computer science theory 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. An accessible and rigorous introduction to the essential fundamentals of computer science theory, written specifically for undergraduates taking introduction to the theory of computation Features a practical, interactive approach using real computer programs (Python in the text, with forthcoming Java alternatives online) to enhance motivation and understanding Gives equal emphasis to computability and complexity Includes special topics that demonstrate the profound nature of key ideas in the theory of computation Lecture slides and Python programs are available at whatcanbecomputed.com

How long is What Can Be Computed??

What Can Be Computed? by John MacCormick is 408 pages long, and a total of 105,264 words.

This makes it 138% the length of the average book. It also has 129% more words than the average book.

How Long Does it Take to Read What Can Be Computed? Aloud?

The average oral reading speed is 183 words per minute. This means it takes 9 hours and 35 minutes to read What Can Be Computed? aloud.

What Reading Level is What Can Be Computed??

What Can Be Computed? is suitable for students ages 12 and up.

Note that there may be other factors that effect this rating besides length that are not factored in on this page. This may include things like complex language or sensitive topics not suitable for students of certain ages.

When deciding what to show young students always use your best judgement and consult a professional.

Where Can I Buy What Can Be Computed??

What Can Be Computed? by John MacCormick is sold by several retailers and bookshops. However, Read Time works with Amazon to provide an easier way to purchase books.

To buy What Can Be Computed? by John MacCormick on Amazon click the button below.