Enumerability · Decidability Computability (eBook, PDF)
Hans Hermes
eBook, PDF

Enumerability · Decidability Computability (eBook, PDF)

An Introduction to the Theory of Recursive Functions

Übersetzer: Herman, Gabor T.; Plassmann, O.
Versandkostenfrei!
Sofort per Download lieferbar
40,95 €
inkl. MwSt.
Alle Infos zum eBook verschenken
PAYBACK Punkte
20 °P sammeln!
Once we have accepted a precise replacement of the concept of algo rithm, it becomes possible to attempt the problem whether there exist well-defined collections of problems which cannot be handled by algo rithms, and if that is the case, to give concrete cases of this kind. Many such investigations were carried out during the last few decades. The undecidability of arithmetic and other mathematical theories was shown, further the unsolvability of the word problem of group theory. Many mathematicians consider these results and the theory on which they are based to be the most characteristic ac...

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.