Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions: 127 (Grundlehren der mathematischen Wissenschaften, 127) - Image 1

£40.84

Springer Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions: 127 (Grundlehren der mathematischen Wissenschaften, 127)

Name: Enumerability Decidability Computability: An Introduction to the Theory of Recursive Functions: 127 (Grundlehren der mathematischen Wissenschaften, 127)
Brand: Springer
Price: 40.84 GBP
Availability: InStock

Maths

About as cheap as it gets. The only time it was cheaper was 11 months ago.

£41 today · all-time low £39 (Jul 2025) · usually the usual

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

Historical

Generating forecast...

Price Distribution

Price distribution over 250 days • 3 price levels

Days at Price

Current Price

Price Analysis

Most common price: £41 (120 days, 48.0%)

Price range: £40 - £42

Price levels: 3 different prices over 250 days

Description

Once we have accepted a precise replacement of the concept of algo rithm, it becomes possible to attempt the problem whether there exist well-defined collections of problems which cannot be handled by algo rithms, and if that is the case, to give concrete cases of this kind. Many such investigations were carried out during the last few decades. The undecidability of arithmetic and other mathematical theories was shown, further the unsolvability of the word problem of group theory. Many mathematicians consider these results and the theory on which they are based to be the most characteristic achievements of mathe matics in the first half of the twentieth century. If we grant the legitimacy of the suggested precise replacements of the concept of algorithm and related concepts, then we can say that the mathematicians have shown by strictly mathematical methods that there exist mathematical problems which cannot be dealt with by the methods of calculating mathematics. In view of the important role which mathematics plays today in our conception of the world this fact is of great philosophical interest. Post speaks of a natural law about the "limitations of the mathematicizing power of Homo Sapiens". Here we also find a starting point for the discussion of the question, what the actual creative activity of the mathematician consists in. In this book we shall give an introduction to the theory of algorithms.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3642461808
Category: Books > Subjects > Science, Nature & Maths > Popular Science > Maths
Domain: Amazon UK
Publication Date: 29 February 2012
Listed Since: 12 July 2012

Barcode

No barcode data available

Springer Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions: 127 (Grundlehren der mathematischen Wissenschaften, 127)

About as cheap as it gets. The only time it was cheaper was 11 months ago.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

The Power of Algorithms: Inspiration and Examples in Everyday Life

Algorithms Unplugged

Algorithms Unplugged

Algorithmic Architecture

Algorithmic Architecture

Algorithmics: The Spirit of Computing

Algorithmics: The Spirit of Computing

Algorithm Design: A Methodological Approach - 150 problems and detailed solutions

How to Think about Algorithms

Mathematics for the Analysis of Algorithms: v. 1 (Progress in Theoretical Computer Science)

The Algorithm Design Manual (Texts in Computer Science)

Algorithmics: The Spirit of Computing

The Algorithm Design Manual (Texts in Computer Science)

Guide to Competitive Programming: Learning and Improving Algorithms Through Contests (Undergraduate Topics in Computer Science)

Algorithms from THE BOOK

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

Problems on Algorithms: A Comprehensive Exercise Book for Students in Software Engineering

Introduction to the Design and Analysis of Algorithms: International Edition (International Version)

Algorithms as a Basis of Modern Applied Mathematics: 404 (Studies in Fuzziness and Soft Computing, 404)

An Introduction To The Analysis Of Algorithms (3rd Edition)

The Cambridge Handbook of the Law of Algorithms

Grundlagen der Informatik: für das Nebenfachstudium

Algorithmic Cultures: Essays on Meaning, Performance and New Technologies (Routledge Advances in Sociology)

Algoritmi: Lo spirito dell'informatica (UNITEXT)