On primitive recursive real numbers

DOI10.4064/FM-49-2-105-118MaRDI QIDQ5596797zbMATH OpenOpenAlexFDO

Authors R. Sherman Lehman

Publication date 1961

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/213580

zbMATH Keywords

recursion theory, constructive mathematics

Cited in

(12)

• On the complexity of conversion between classic real number representations
• Dedekind cuts and long strings of zeros in base expansions
• On subrecursive representation of irrational numbers: contractors and Baire sequences
• Computable irrational numbers with representations of surprising complexity
• Continued fractions of primitive recursive real numbers
• Primitive recursiveness of real numbers under different representations
• Semi-effective numberings and definitions of the computable numbers
• Subrecursive incomparability of the graphs of standard and dual Baire sequences
• Subrecursive graphs of representations of irrational numbers
• Interplay between insertion of zeros and the complexity of Dedekind cuts
• On representations of irrational numbers and the computational complexity of converting between such representations
• A degree structure on representations of irrational numbers

This page was built for publication: On primitive recursive real numbers

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