Turing Computability: Theory and Applications (Theory and Applications of Computability) - Image 1

£46.10

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

Name: Turing Computability: Theory and Applications (Theory and Applications of Computability)
Brand: Springer
Price: 45.96 GBP
Availability: InStock

Databases

Price History & Forecast

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

Historical

Generating forecast...

Price Distribution

Price distribution over 32 days • 1 price levels

Days at Price

Price Analysis

Most common price: £46 (32 days, 100.0%)

Price range: £46 - £46

Price levels: 1 different prices over 32 days

Description

Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This model led to both the development of actual computers and to computability theory, the study of what machines can and cannot compute. This book presents classical computability theory from Turing and Post to current results and methods, and their use in studying the information content of algebraic structures, models, and their relation to Peano arithmetic. The author presents the subject as an art to be practiced, and an art in the aesthetic sense of inherent beauty which all mathematicians recognize in their subject. Part I gives a thorough development of the foundations of computability, from the definition of Turing machines up to finite injury priority arguments. Key topics include relative computability, and computably enumerable sets, those which can be effectively listed but not necessarily effectively decided, such as the theorems of Peano arithmetic. Part IIincludes the study of computably open and closed sets of reals and basis and nonbasis theorems for effectively closed sets. Part III covers minimal Turing degrees. Part IV is an introduction to games and their use in proving theorems. Finally, Part V offers a short history of computability theory. The author has honed the content over decades according to feedback from students, lecturers, and researchers around the world. Most chapters include exercises, and the material is carefully structured according to importance and difficulty. The book is suitable for advanced undergraduate and graduate students in computer science and mathematics and researchers engaged with computability and mathematical logic.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3662568586
Category: Books > Subjects > Computing & Internet > Databases
Domain: Amazon UK
Release Date: 07 June 2018
Listed Since: 07 June 2018

Barcode

No barcode data available

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

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

The Foundations of Computability Theory

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

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

Computability

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

Automata and Computability (Undergraduate Texts in Computer Science)

Handbook of Computability and Complexity in Analysis (Theory and Applications of Computability)

Computability Theory: An Introduction to Recursion Theory

Automata and Computability

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

Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)

Algebraic Complexity Theory: 315 (Grundlehren der mathematischen Wissenschaften, 315)

Computability Theory and Its Applications: Current Trends and Open Problems (Contemporary Mathematics)

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

A Programming Approach to Computability (Monographs in Computer Science)

Theory of Computation

Computability: An Introduction to Recursive Function Theory

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

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Demystifying Computation: A Hands-on Introduction

Springer Higher-Order Computability Theory and Applications

Higher-Order Computability (Theory and Applications of Computability)

Theory of Computation (Texts in Computer Science)

Computational Complexity: A Modern Approach