scientific article
From MaRDI portal
Publication:3855167
zbMath0422.03022MaRDI QIDQ3855167
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computable functionseffective operationsinductive definabilityhereditarily partial functionshierarchies of finite typeKleene's schematalimit space structuresrecursively continuous functions
Computability and recursion theory (03D99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65) Proof theory and constructive mathematics (03F99)
Related Items (6)
The equivalence of bar recursion and open recursion ⋮ Unnamed Item ⋮ Speed-up theorems in type-2 computations using oracle Turing machines ⋮ COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS ⋮ On the Computability of the Fan Functional ⋮ A type-theoretical alternative to ISWIM, CUCH, OWHY
This page was built for publication: