Vertel uw vrienden over dit artikel:
Enumerability * Decidability Computability: An Introduction to the Theory of Recursive Functions - Grundlehren der mathematischen Wissenschaften Hans Hermes Softcover reprint of the original 2nd ed. 1969 edition
Enumerability * Decidability Computability: An Introduction to the Theory of Recursive Functions - Grundlehren der mathematischen Wissenschaften
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 | Boeken Paperback Book (Boek met zachte kaft en gelijmde rug) |
| Vrijgegeven | 29 februari 2012 |
| ISBN13 | 9783642461804 |
| Uitgevers | Springer-Verlag Berlin and Heidelberg Gm |
| Pagina's | 250 |
| Afmetingen | 155 × 235 × 14 mm · 376 g |
| Taal en grammatica | Engels |
| Vertaler | Herman, Gabor T. |
| Vertaler | Plassmann, O. |
Kerstcadeautjes kunnen tot en met 31 januari worden ingewisseld