Enumerability * Decidability Computability: An Introduction to the Theory of Recursive Functions - Grundlehren der mathematischen Wissenschaften - Hans Hermes - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783642461804 - February 29, 2012
In case cover and title do not match, the title is correct

Enumerability * Decidability Computability: An Introduction to the Theory of Recursive Functions - Grundlehren der mathematischen Wissenschaften Softcover reprint of the original 2nd ed. 1969 edition

Hans Hermes

Price
CA$ 89.49

Ordered from remote warehouse

Expected delivery Jun 3 - 17

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Enumerability * Decidability Computability: An Introduction to the Theory of Recursive Functions - Grundlehren der mathematischen Wissenschaften Softcover reprint of the original 2nd ed. 1969 edition

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.

250 pages, biography

Media Books     Paperback Book   (Book with soft cover and glued back)
Released February 29, 2012
ISBN13 9783642461804
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 250
Dimensions 155 × 235 × 14 mm   ·   376 g
Language English  
Translator Herman, Gabor T.
Translator Plassmann, O.
Show all

More by Hans Hermes

See all of Hans Hermes ( e.g. Paperback Book )