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

NOK 719

Bestillingsvarer

Forventes levert 22. mai - 3. jun

Kundene våre sier:

14 dages returrett

Toppvurdering på Trustpilot

Legg til iMusic ønskeliste

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	Bøker Pocketbok (Bok med mykt omslag og limt rygg)
Utgitt	29. februar 2012
ISBN13	9783642461804
Utgivere	Springer-Verlag Berlin and Heidelberg Gm
Antall sider	250
Mål	155 × 235 × 14 mm · 376 g
Språk	Engelsk
Oversetter	Herman, Gabor T.
Oversetter	Plassmann, O.

Vis alle

Mer med Hans Hermes

Se alt med Hans Hermes ( f.eks. Pocketbok )