Gå direkte til innholdet
Computability
Spar

Computability

Forfatter:
pocket, 1980
Engelsk

This title is an introduction to computability theory covering: non-computability and undecidability; the theory of recursive and recursively enumerable sets; Gildel's incompleteness theorem; degrees of unsolvability; the recursion theorems; and the theory of complexity of computation.

Undertittel
An Introduction to Recursive Function Theory
Forfatter
Nigel Cutland
ISBN
9780521294652
Språk
Engelsk
Vekt
410 gram
Utgivelsesdato
19.6.1980
Antall sider
264