On subrecursive representability of irrational numbers
From MaRDI portal
Recommendations
Cited in
(16)- Irrational-based computability of functions
- 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
- On some properties of irrational subspaces
- Computable irrational numbers with representations of surprising complexity
- scientific article; zbMATH DE number 3841838 (Why is no real title available?)
- On an approach to the expansion of irrational numbers
- On subrecursive representability of irrational numbers, part II
- Subrecursive incomparability of the graphs of standard and dual Baire sequences
- Elementarily traceable irrational numbers
- Subrecursive graphs of representations of irrational numbers
- Interplay between insertion of zeros and the complexity of Dedekind cuts
- On representations of irrational numbers and the computational complexity of converting between such representations
- On S-degrees of some representations of irrational numbers
- A degree structure on representations of irrational numbers
This page was built for publication: On subrecursive representability of irrational numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593495)