Computability pp 367-383 | Cite as


  • Klaus Weihrauch
Part of the EATCS Monographs on Theoretical Computer Science book series (EATCS, volume 9)


In Chapter 3.1 we have introduced Type 2 constructivity and computability on the spaces Pω, Bo, and ℂo explicitly and we have shown that each of these concepts can be derived from any other one. In Chapter 3.2 we have chosen Baire’s space B as our basic Type 2 space. We have developed a theory of constructivity and a more special theory of computability both of which are formally very similar to ordinary Type 1 recursion theory. In this chapter the basic Type 2 theory on Baire’s space will be extended to a theory of representations.


Computable Function Negative Information Computational Version Partial Representation Recursion Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Klaus Weihrauch
    • 1
  1. 1.FB Mathematik und InformatikFern Universität HagenHagenGermany

Personalised recommendations