The Foundations of Computability Theory - Image 1

£45.90

Springer The Foundations of Computability Theory

Name: The Foundations of Computability Theory
Brand: Springer
Price: 49.9 GBP
Availability: InStock

Computer Science

Price History & Forecast

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

Historical

Generating forecast...

Price Distribution

Price distribution over 21 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £50 (16 days, 76.2%)

Price range: £46 - £50

Price levels: 2 different prices over 21 days

Description

This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into historical context, emphasizing the motivation for ideas as well as their logical and formal development. In Part I the author introduces computability theory, with chapters on the foundational crisis of mathematics in the early twentieth century, and formalism. In Part II he explains classical computability theory, with chapters on the quest for formalization, the Turing Machine, and early successes such as defining incomputable problems, c.e. (computably enumerable) sets, and developing methods for proving incomputability. In Part III he explains relative computability, with chapters on computation with external help, degrees of unsolvability, the Turing hierarchy of unsolvability, the class of degrees of unsolvability, c.e. degrees and the priority method, and the arithmetical hierarchy. Finally, in the new Part IV the author revisits thecomputability (Church-Turing) thesis in greater detail. He offers a systematic and detailed account of its origins, evolution, and meaning, he describes more powerful, modern versions of the thesis, and he discusses recent speculative proposals for new computing paradigms such as hypercomputing. This is a gentle introduction from the origins of computability theory up to current research, and it will be of value as a textbook and guide for advanced undergraduate and graduate students and researchers in the domains of computability theory and theoretical computer science. This new edition is completely revised, with almost one hundred pages of new material. In particular the author applied more up-to-date, more consistent terminology, and he addressed some notational redundancies and minor errors. He developed a glossary relating to computability theory, expanded the bibliographic references with new entries, and added the new part described above and other new sections.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3662624230
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Release Date: 14 November 2021
Listed Since: 19 October 2021

Barcode

No barcode data available

Springer The Foundations of Computability Theory

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

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

Computability Theory: An Introduction to Recursion Theory

Computability

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

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

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

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

Theory of Computation

Computability: An Introduction to Recursive Function Theory

A Programming Approach to Computability (Monographs in Computer Science)

Computational Complexity: A Conceptual Perspective

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

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

Automata and Computability (Undergraduate Texts in Computer Science)

Computational Complexity: A Modern Approach

Automata and Computability

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

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

Theory of Computation (Texts in Computer Science)

Demystifying Computation: A Hands-on Introduction

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

Springer Higher-Order Computability Theory and Applications

Higher-Order Computability (Theory and Applications of Computability)

Language Computability and Formal Language Theory