Interplay between insertion of zeros and the complexity of Dedekind cuts
From MaRDI portal
Publication:6594830
DOI10.3233/COM-230469MaRDI QIDQ6594830
Publication date: 29 August 2024
Published in: Computability (Search for Journal in Brave)
computable analysisDedekind cutssubrecursive classesbase expansionsirrational number representations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Streamlined subrecursive degree theory
- Real numbers, continued fractions and complexity classes
- On the continued fraction representation of computable real numbers
- On general sum approximations of irrational numbers
- Dedekind cuts and long strings of zeros in base expansions
- Computable irrational numbers with representations of surprising complexity
- \(\mathcal M^2\)-computable real numbers
- Continued fractions of primitive recursive real numbers
- On computable sequences
- On the definitions of some complexity classes of real numbers
- On subrecursive representability of irrational numbers
- Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers
- On subrecursive representability of irrational numbers, part II
- On primitive recursive real numbers
- Recursive real numbers
- Nicht konstruktiv beweisbare Sätze der Analysis
This page was built for publication: Interplay between insertion of zeros and the complexity of Dedekind cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6594830)
