On subrecursive representability of irrational numbers, part II
From MaRDI portal
Publication:5240584
DOI10.3233/COM-170081zbMath1450.03008OpenAlexW2762493074MaRDI QIDQ5240584
Publication date: 28 October 2019
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/com-170081
Recursive functions and relations, subrecursive hierarchies (03D20) Computation over the reals, computable analysis (03D78)
Related Items
Elementarily traceable irrational numbers ⋮ Subrecursive graphs of representations of irrational numbers ⋮ Unnamed Item ⋮ Computable irrational numbers with representations of surprising complexity ⋮ Liouville numbers and the computational complexity of changing bases ⋮ On the complexity of conversion between classic real number representations ⋮ Dedekind cuts and long strings of zeros in base expansions ⋮ On subrecursive representation of irrational numbers: contractors and Baire sequences
This page was built for publication: On subrecursive representability of irrational numbers, part II