Tipsa dina vänner om produkten:
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
Pris
Ft 24.905
Beställningsvara
Förväntad leverans 27 jun - 9 jul
Lägg till din iMusic-önskelista
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
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 | Böcker Pocketbok (Bok med mjukt omslag och limmad rygg) |
Releasedatum | 29 februari 2012 |
ISBN13 | 9783642461804 |
Utgivare | Springer-Verlag Berlin and Heidelberg Gm |
Antal sidor | 250 |
Mått | 155 × 235 × 14 mm · 376 g |
Språk | Engelska |
Översättare | Herman, Gabor T. |
Översättare | Plassmann, O. |