Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Enumerability, Decidability, Computability: An Introduction to the Theory of Recursive Functions

Enumerability, Decidability, Computability: An Introduction to the Theory of Recursive Functions

Book Informaton
Enumerability, Decidability, Computability: An Introduction to the Theory of Recursive Functions

Author

Hans Hermes

Series

Grundlehren der mathematischen Wissenschaften

Volume

127

Year of Publication

1965

Publisher

Springer Berlin Heidelberg

Language

EN

ISBN

9783662116876, 9783662116869

ARI Id

1674219676407

Find on

World Cat

OpenLibrary

Internet Archive

This page has been accessed 7 times.
Access Options
Springer
Citation Options
Download Citation
Chapters/HeadingsAuthor(s)PagesInfo
Loading...
Chapters/HeadingsAuthor(s)PagesInfo
Topics
Recursive functions Algorithms Computable functions Goedel's theorem