Type 2 recursion theory (Q1073021): Difference between revisions

An attempt is made to lay a basis for a general, unified, concise, and simple theory of computable and continuous functions from \({\mathbb{F}}\) to \({\mathbb{F}}\) or \({\mathbb{N}}\), where \({\mathbb{F}}=\{f:{\mathbb{N}}\to {\mathbb{N}}\}\). The theory is formally very similar to ordinary recursion theory. It splits into a purely topological version and more special theory of computability. The basic definitions are given and fundamental properties are proved. As an example it is shown how the theory of recursively enumerable subsets of \({\mathbb{N}}\) can be transferred to a theory of open and a theory of computably open subsets of \({\mathbb{F}}\).