Interplay between insertion of zeros and the complexity of Dedekind cuts

DOI10.3233/COM-230469MaRDI QIDQ6594830zbMATH OpenFDO

Authors Ivan T. Georgiev

Publication date 29 August 2024

Published in Computability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/COM-230469

zbMATH Keywords

base expansionscomputable analysisDedekind cutsirrational number representationssubrecursive classes

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Cites work

• M^2-computable real numbers
• Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers
• Computable irrational numbers with representations of surprising complexity
• Continued fractions of primitive recursive real numbers
• Dedekind cuts and long strings of zeros in base expansions
• scientific article; zbMATH DE number 3857078 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• Nicht konstruktiv beweisbare Sätze der Analysis
• On computable sequences
• On general sum approximations of irrational numbers
• On primitive recursive real numbers
• On subrecursive representability of irrational numbers
• On subrecursive representability of irrational numbers, part II
• On the continued fraction representation of computable real numbers
• On the definitions of some complexity classes of real numbers
• Real numbers, continued fractions and complexity classes
• Recursive real numbers
• Streamlined subrecursive degree theory

Cited in

(2)

• 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: 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)