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.
KeywordsComputable Function Negative Information Computational Version Partial Representation Recursion Theory
Unable to display preview. Download preview PDF.