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

£39.35

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

Name: What Can Be Computed? - A Practical Guide to the Theory of Computation
Brand: Princeton University Press
Price: 39.35 GBP
Availability: InStock

Information Systems

Price History & Forecast

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

Historical

Generating forecast...

Not enough data points to display chart (need at least 2 points)

Price Distribution

Price distribution over 1 days • 1 price levels

Days at Price

Price Analysis

Most common price: £39 (1 days, 100.0%)

Price range: £39 - £39

Price levels: 1 different prices over 1 days

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

Product Specifications

Brand: Princeton University Press
Format: hardcover
ASIN: 0691170665
Category: Books > Subjects > Computing & Internet > Computer Science > Information Systems
Domain: Amazon UK
Release Date: 18 May 2018
Listed Since: 19 September 2017

Barcode

No barcode data available

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

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Theory of Computation

Automata and Computability (Undergraduate Texts in Computer Science)

Computability Theory: An Introduction to Recursion Theory

The Foundations of Computability Theory

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)

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

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

Automata and Computability

Computability

Computability: An Introduction to Recursive Function Theory

Advances in Unconventional Computing: Volume 1: Theory: 22 (Emergence, Complexity and Computation, 22)

Understanding Computation: Pillars, Paradigms, Principles (Texts in Computer Science)

Theory of Computation (Texts in Computer Science)

Computability and Complexity

Understanding Computation: Pillars, Paradigms, Principles (Texts in Computer Science)

Demystifying Computation: A Hands-on Introduction

Language Computability and Formal Language Theory

The Nature of Computation

Computation Engineering: Applied Automata Theory and Logic

Computational Complexity: A Conceptual Perspective

Computational Complexity: A Modern Approach

Theory of Reversible Computing (Monographs in Theoretical Computer Science. An EATCS Series)

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

The Incomputable: Journeys Beyond the Turing Barrier (Theory and Applications of Computability)