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

DKK 569

Bestilles fra fjernlager

Forventes klar til forsendelse 17. - 27. maj.

Vores kunder siger:

14 dages fuld returret

Topvurdering på Trustpilot

Tilføj til din iMusic ønskeseddel

Eller

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

Medie	Bøger Paperback Bog (Bog med blødt omslag og limet ryg)
Udgivet	29. februar 2012
ISBN13	9783642461804
Forlag	Springer-Verlag Berlin and Heidelberg Gm
Antal sider	250
Mål	155 × 235 × 14 mm · 376 g
Sprog	Engelsk
Oversætter	Herman, Gabor T.
Oversætter	Plassmann, O.

Vis alle

Mere med Hans Hermes

Se alt med Hans Hermes ( f.eks. Paperback Bog )