The continuous functionals; computations, recursions and degrees

DOI10.1016/0003-4843(81)90014-0zbMath0472.03037OpenAlexW2046465708MaRDI QIDQ3926569

Dag Normann

Publication date: 1981

Published in: Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0003-4843(81)90014-0

zbMATH Keywords

computabilitycountable recursionKleene-degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Higher-type and set recursion theory (03D65)

Related Items (3)

Axiomatic recursion theory and the continuous functionals ⋮ R.E. degrees of continuous functionals ⋮ Computing with Functionals—Computability Theory or Computer Science?

This page was built for publication: The continuous functionals; computations, recursions and degrees