Divergence bounded computable real numbers
From MaRDI portal
Publication:817855
DOI10.1016/J.TCS.2005.09.054zbMATH Open1094.03050OpenAlexW2064013414MaRDI QIDQ817855FDOQ817855
Authors: Dianchen Lu, Kejin Bao, Xizhong Zheng 
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
Recommendations
Applications of computability and recursion theory (03D80) Constructive and recursive analysis (03F60)
Cites Work
- Weakly computable real numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Nicht konstruktiv beweisbare Sätze der Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cohesive sets and recursively enumerable Dedekind cuts
- On the hierarchy and extension of monotonically computable real numbers.
- Title not available (Why is that?)
- On the Turing Degrees of Weakly Computable Real Numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2003
- A characterization of c. e. random reals
Cited In (9)
- h-monotonically computable real numbers
- New Computational Paradigms
- Classification of the computable approximations by divergence boundings
- Classification of computably approximable real numbers
- On the divergence bounded computable real numbers
- Finitely bounded effective computability
- Title not available (Why is that?)
- Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals
- Computability of Real Numbers
This page was built for publication: Divergence bounded computable real numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817855)
