Computability of Real Numbers

DOI10.1007/978-3-030-59234-9_1OpenAlexW3166372913MaRDI QIDQ5024567

Zheng, Xizhong, Robert Rettinger

Publication date: 26 January 2022

Published in: Theory and Applications of Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-59234-9_1

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78)

Related Items (1)

L 2 -Betti numbers and computability of reals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday
• Divergence bounded computable real numbers
• A hierarchy of Turing degrees of divergence bounded computable real numbers
• Classification of computably approximable real numbers
• Level sets of univalent functions
• Presentations of computably enumerable reals.
• Differences of halting probabilities
• Closure properties of real number classes under CBV functions
• Randomness and Recursive Enumerability
• Randomness, Computability, and Density
• Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time
• A Note on the Differences of Computably Enumerable Reals
• On the Divergence Bounded Computable Real Numbers
• Degrees of d. c. e. reals
• Weak computability and representation of reals
• Algorithmic Randomness and Complexity
• On the definitions of computable real continuous functions
• On the definitions of some complexity classes of real numbers
• Relative randomness and real closed fields
• A Theory of Program Size Formally Identical to Information Theory
• On the Turing Degrees of Weakly Computable Real Numbers
• Effective Riemann mappings of multiply connected domains and Riemann surfaces
• Computing and Combinatorics
• On computable approximations of Landau's constant
• Recursion Theory and Dedekind Cuts
• Computing and Combinatorics
• New Computational Paradigms
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Nicht konstruktiv beweisbare Sätze der Analysis
• Criteria of constructibility for real numbers
• Recursive Real Numbers
• On the Bloch-Landau Constant
• Recursively enumerable reals and Chaitin \(\Omega\) numbers

This page was built for publication: Computability of Real Numbers