Dedekind cuts and long strings of zeros in base expansions

DOI10.1007/978-3-030-80049-9_23OpenAlexW3183570752MaRDI QIDQ2117788FDOQ2117788

Yanyan Li

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80049-9_23

zbMATH Keywords

computable analysisDedekind cutssubrecursive classesbase expansionsirrational number representations

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Nicht konstruktiv beweisbare Sätze der Analysis
• Streamlined subrecursive degree theory
• On the definitions of some complexity classes of real numbers
• Real numbers, continued fractions and complexity classes
• On computable sequences
• On the continued fraction representation of computable real numbers
• \(\mathcal M^2\)-computable real numbers
• Recursive real numbers
• Continued fractions of primitive recursive real numbers
• On subrecursive representability of irrational numbers
• On subrecursive representability of irrational numbers, part II
• On primitive recursive real numbers

Cited In (2)

• Interplay between insertion of zeros and the complexity of Dedekind cuts
• Title not available (Why is that?)

This page was built for publication: Dedekind cuts and long strings of zeros in base expansions

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