Recommendations
Cites work
- A hierarchy of Turing degrees of divergence bounded computable real numbers
- A Note on the Differences of Computably Enumerable Reals
- A Theory of Program Size Formally Identical to Information Theory
- Algorithmic randomness and complexity.
- Classification of computably approximable real numbers
- Closure properties of real number classes under CBV functions
- Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday
- Computing a solution of Feigenbaum's functional equation in polynomial time
- Computing and Combinatorics
- Computing and Combinatorics
- Criteria of constructibility for real numbers
- Degrees of d. c. e. reals
- Differences of halting probabilities
- Divergence bounded computable real numbers
- Effective Riemann mappings of multiply connected domains and Riemann surfaces
- scientific article; zbMATH DE number 5309066 (Why is no real title available?)
- scientific article; zbMATH DE number 4023258 (Why is no real title available?)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3788601 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 1222611 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1796999 (Why is no real title available?)
- scientific article; zbMATH DE number 3342830 (Why is no real title available?)
- scientific article; zbMATH DE number 3342831 (Why is no real title available?)
- Level sets of univalent functions
- New Computational Paradigms
- Nicht konstruktiv beweisbare Sätze der Analysis
- On computable approximations of Landau's constant
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On the Bloch-Landau Constant
- On the definitions of computable real continuous functions
- On the definitions of some complexity classes of real numbers
- On the divergence bounded computable real numbers
- On the Turing Degrees of Weakly Computable Real Numbers
- Presentations of computably enumerable reals.
- Randomness and recursive enumerability
- Randomness, computability, and density
- Recursion Theory and Dedekind Cuts
- Recursive Real Numbers
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- Relative randomness and real closed fields
- Weak computability and representation of reals
Cited in
(10)- Real numbers and computers
- Computing over the reals with addition and order
- Real number computations: On the use of information
- Real computations with fake numbers
- Real number computability and domain theory
- On logarithmic-space computable real numbers
- Representations of natural numbers and computability of various functions
- Spectrum of the field of computable real numbers
- Logical Approaches to Computational Barriers
- L 2 -Betti numbers and computability of reals
This page was built for publication: Computability of Real Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5024567)
