How Long to Read Theory of Computation

How Long Does it Take to Read Theory of Computation?

It takes the average reader 6 hours and 50 minutes to read Theory of Computation by George Tourlakis

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

Description

Learn the skills and acquire the intuition to assess the theoretical limitations of computer programming Offering an accessible approach to the topic, Theory of Computation focuses on the metatheory of computing and the theoretical boundaries between what various computational models can do and not do—from the most general model, the URM (Unbounded Register Machines), to the finite automaton. A wealth of programming-like examples and easy-to-follow explanations build the general theory gradually, which guides readers through the modeling and mathematical analysis of computational phenomena and provides insights on what makes things tick and also what restrains the ability of computational processes. Recognizing the importance of acquired practical experience, the book begins with the metatheory of general purpose computer programs, using URMs as a straightforward, technology-independent model of modern high-level programming languages while also exploring the restrictions of the URM language. Once readers gain an understanding of computability theory—including the primitive recursive functions—the author presents automata and languages, covering the regular and context-free languages as well as the machines that recognize these languages. Several advanced topics such as reducibilities, the recursion theorem, complexity theory, and Cook's theorem are also discussed. Features of the book include: A review of basic discrete mathematics, covering logic and induction while omitting specialized combinatorial topics A thorough development of the modeling and mathematical analysis of computational phenomena, providing a solid foundation of un-computability The connection between un-computability and un-provability: Gödel's first incompleteness theorem The book provides numerous examples of specific URMs as well as other programming languages including Loop Programs, FA (Deterministic Finite Automata), NFA (Nondeterministic Finite Automata), and PDA (Pushdown Automata). Exercises at the end of each chapter allow readers to test their comprehension of the presented material, and an extensive bibliography suggests resources for further study. Assuming only a basic understanding of general computer programming and discrete mathematics, Theory of Computation serves as a valuable book for courses on theory of computation at the upper-undergraduate level. The book also serves as an excellent resource for programmers and computing professionals wishing to understand the theoretical limitations of their craft.

How long is Theory of Computation?

Theory of Computation by George Tourlakis is 410 pages long, and a total of 102,500 words.

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

How Long Does it Take to Read Theory of Computation Aloud?

The average oral reading speed is 183 words per minute. This means it takes 9 hours and 20 minutes to read Theory of Computation aloud.

What Reading Level is Theory of Computation?

Theory of Computation 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 Theory of Computation?

Theory of Computation by George Tourlakis is sold by several retailers and bookshops. However, Read Time works with Amazon to provide an easier way to purchase books.

To buy Theory of Computation by George Tourlakis on Amazon click the button below.