The Foundations of Computability Theory - Image 1

£45.90

Springer The Foundations of Computability Theory

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

Computer Science

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

£46 today · usual range £0–£0 · best ever £25

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 616 days • 616 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 616 days • 8 price levels

Days at Price

Current Price

Price Analysis

Most common price: £46 (340 days, 55.2%)

Price range: £25 - £53

Price levels: 8 different prices over 616 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

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

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

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

New Computational Paradigms: First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings: 3526 (Lecture Notes in Computer Science, 3526)

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

Theory of Computation (Texts in Computer Science)

Computability Theory: An Introduction to Recursion Theory

Computability In Context: Computation And Logic In The Real World

Demystifying Computation: A Hands-on Introduction

Computability and Logic

A Programming Approach to Computability (Monographs in Computer Science)

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

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

Computability and Complexity

Theory of Computation

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

Computational Complexity: A Modern Approach

Computability

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

Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)

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

Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)

Theoretical Computer Science: 6th IFIP WG 2.2 International Conference, TCS 2010, Held as a Part of WCC 2010, Brisbane, Australia, September 20-23, ... and Communication Technology, 323)

Effective Mathematics of the Uncountable: 41 (Lecture Notes in Logic, Series Number 41)