Computable irrational numbers with representations of surprising complexity

DOI10.1016/j.apal.2020.102893zbMath1481.03041OpenAlexW3092058905WikidataQ112880177 ScholiaQ112880177MaRDI QIDQ2216036

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

best approximationscomputable analysissubrecursive classesirrational number representationssum approximations

Mathematics Subject Classification ID

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

Related Items (3)

Subrecursive graphs of representations of irrational numbers ⋮ Unnamed Item ⋮ On subrecursive representation of irrational numbers: contractors and Baire sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Streamlined subrecursive degree theory
• Real numbers, continued fractions and complexity classes
• On the continued fraction representation of computable real numbers
• Classical recursion theory. Vol. II
• On general sum approximations of irrational numbers
• Formula2-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
• On subrecursive representability of irrational numbers, part II
• On primitive recursive real numbers
• Nicht konstruktiv beweisbare Sätze der Analysis

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