Computability

Front Cover
Springer-Verlag, 1987 - Mathematics - 517 pages
Intends to lay a common basis for the different branches of recursion theory. Leads from the very basic theory to modern concepts of computability. Consists of three consecutive parts: 1. Basic Concepts of Computability. 2. Traditional Recursion Theory. 3. Unified Type 2 theory of constructivity and computability on Baire's space including a general the- ory of representations.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Prerequisites and Notation
1
Churchs Thesis
79
Type 1 Recursion Theory
137
Copyright

3 other sections not shown

Other editions - View all

Common terms and phrases

Bibliographic information