Ebook: Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions
Author: Hans Hermes (auth.)
- Tags: Mathematics general
- Series: Die Grundlehren der Mathematischen Wissenschaften 127
- Year: 1965
- Publisher: Springer Berlin Heidelberg
- Language: English
- pdf
Content:
Front Matter....Pages II-X
Introductory Reflections on Algorithms....Pages 1-30
Turing Machines....Pages 31-59
?-Recursive Functions....Pages 59-93
The Equivalence of Turing-Computability and ?-Recursiveness....Pages 93-112
Recursive Functions....Pages 113-140
Undecidable Predicates....Pages 141-187
Miscellaneous....Pages 187-240
Back Matter....Pages 241-245
Content:
Front Matter....Pages II-X
Introductory Reflections on Algorithms....Pages 1-30
Turing Machines....Pages 31-59
?-Recursive Functions....Pages 59-93
The Equivalence of Turing-Computability and ?-Recursiveness....Pages 93-112
Recursive Functions....Pages 113-140
Undecidable Predicates....Pages 141-187
Miscellaneous....Pages 187-240
Back Matter....Pages 241-245
....
Download the book Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions for free or read online
Continue reading on any device:
Last viewed books
Related books
{related-news}
Comments (0)