£84.57

Wiley Theory of Computation

Name: Theory of Computation
Brand: Wiley
Price: 84.57 GBP
Availability: InStock

Computer Science

This is the usual price. Wait for it to drop, or tell us your number.

£85 today · usual range £0–£0 · best ever £49

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 639 days • 639 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 639 days • 5 price ranges

Days at Price

Current Price

Price Analysis

Most common range: £92-102 (356 days, 55.7%)

Price range: £49 - £102

Price levels: 5 price ranges over 639 days

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.

Product Specifications

Brand: Wiley
Format: Hardcover
ASIN: 1118014782
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Release Date: 27 April 2012
Listed Since: 07 December 2010

Barcode

No barcode data available

Wiley Theory of Computation

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

What Can Be Computed? – A Practical Guide to the Theory of Computation

Computability Theory: 26 (Chapman Hall/CRC Mathematics Series)

Computability

Theory of Computation: Automata, Formal Languages, Computation and Complexity

Computability: An Introduction to Recursive Function Theory

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)

Theory of Computation (Texts in Computer Science)

Introduction to the Theory of Computation

Computability Theory: An Introduction to Recursion Theory

Introduction to the Theory of Computation

A Programming Approach to Computability (Monographs in Computer Science)

Classical Recursion Theory, Volume II (Volume 143) (Studies in Logic and the Foundations of Mathematics, Volume 143)

Automata and Computability

Automata and Computability (Undergraduate Texts in Computer Science)

Programs as Diagrams: From Categorical Computability to Computable Categories (Theory and Applications of Computability)

Introduction to the Theory of Computation

Computability and Logic

The Foundations of Computability Theory

Turing Computability: Theory and Applications (Theory and Applications of Computability)

Programs as Diagrams: From Categorical Computability to Computable Categories (Theory and Applications of Computability)

Logic and Language Models for Computer Science: Third Edition

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Automata, Languages and Programming: 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II: 5556 (Lecture Notes in Computer Science, 5556)

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity