Divergence bounded computable real numbers
From MaRDI portal
Publication:817855
DOI10.1016/J.TCS.2005.09.054zbMath1094.03050OpenAlexW2064013414MaRDI QIDQ817855
Kejin Bao, Dianchen Lu, Zheng, Xizhong
Publication date: 20 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.054
Constructive and recursive analysis (03F60) Applications of computability and recursion theory (03D80)
Related Items (3)
Classification of the Computable Approximations by Divergence Boundings ⋮ Classification of computably approximable real numbers ⋮ Computability of Real Numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the hierarchy and extension of monotonically computable real numbers.
- Cohesive sets and recursively enumerable Dedekind cuts
- On the Turing Degrees of Weakly Computable Real Numbers
- Mathematical Foundations of Computer Science 2003
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Nicht konstruktiv beweisbare Sätze der Analysis
- Weakly computable real numbers
- A characterization of c. e. random reals
This page was built for publication: Divergence bounded computable real numbers