The continuous functionals; computations, recursions and degrees

DOI10.1016/0003-4843(81)90014-0zbMATH Open0472.03037OpenAlexW2046465708MaRDI QIDQ3926569FDOQ3926569

Authors: 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) Higher-type and set recursion theory (03D65) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3926569)