Recursive real numbers

DOI10.2307/2271331MaRDI QIDQ5608009zbMATH OpenOpenAlexFDO

Authors Alistair H. Lachlan

Publication date 1964

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2271331

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60)

Cited in

(9)

• On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
• Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
• Randomness and reducibility
• Liouville numbers and the computational complexity of changing bases
• Dedekind cuts and long strings of zeros in base expansions
• Primitive recursiveness of real numbers under different representations
• Semi-effective numberings and definitions of the computable numbers
• Weakly computable real numbers
• Interplay between insertion of zeros and the complexity of Dedekind cuts

This page was built for publication: Recursive real numbers

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