Computable irrational numbers with representations of surprising complexity

DOI10.1016/J.APAL.2020.102893MaRDI QIDQ2216036zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 15 December 2020

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apal.2020.102893

zbMATH Keywords

computable analysisbest approximationssubrecursive classesirrational number representationssum approximations

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Constructive and recursive analysis (03F60)

Recommendations

• The irrationality exponents of computable numbers
• scientific article; zbMATH DE number 5176841
• Irrational-based computability of functions
• Real numbers of sublinear complexity: irrationality and transcendence measures
• On the complexity of the binary expansions of algebraic irrational numbers (survey)
• On subrecursive representability of irrational numbers
• On the continued fraction representation of computable real numbers
• Beyond Knuth's notation for unimaginable numbers within computational number theory
• The complexity of number-theoretic constants
• Real numbers, continued fractions and complexity classes

Cites work

• scientific article; zbMATH DE number 3857078 (Why is no real title available?)
• scientific article; zbMATH DE number 3720907 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 922628 (Why is no real title available?)
• scientific article; zbMATH DE number 3191379 (Why is no real title available?)
• scientific article; zbMATH DE number 3066801 (Why is no real title available?)
• Classical recursion theory. Vol. II
• Continued fractions of primitive recursive real numbers
• 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
• Streamlined subrecursive degree theory
• \(\mathcal M^2\)-computable real numbers

Cited in

(13)

• On the continued fraction representation of computable real numbers
• On subrecursive representation of irrational numbers: contractors and Baire sequences
• Subrecursive incomparability of the graphs of standard and dual Baire sequences
• Elementarily traceable irrational numbers
• Subrecursive graphs of representations of irrational numbers
• On an approach to the expansion of irrational numbers
• Interplay between insertion of zeros and the complexity of Dedekind cuts
• Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds
• The irrationality exponents of computable numbers
• scientific article; zbMATH DE number 4135939 (Why is no real title available?)
• On subrecursive representability of irrational numbers
• scientific article; zbMATH DE number 5176841 (Why is no real title available?)
• On subrecursive representability of irrational numbers, part II

This page was built for publication: Computable irrational numbers with representations of surprising complexity

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