Classification of computably approximable real numbers

DOI10.1007/S00224-007-9026-5zbMATH Open1176.03020OpenAlexW1999739638MaRDI QIDQ1015380FDOQ1015380

Authors: Xizhong Zheng 

Publication date: 8 May 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-9026-5

Recommendations

• The approximation structure of a computably approximable real
• Weakly computable real numbers
• Classification of the computable approximations by divergence boundings
• Mathematical Foundations of Computer Science 2003
• Publication:4941886

zbMATH Keywords

hierarchycomputabilitycomputable real numberscomputably approximable real numbers

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Hierarchies of computability and definability (03D55) Constructive and recursive analysis (03F60)

Cites Work

• Weakly computable real numbers
• Constructive mathematics: a foundation for computable analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Title not available (Why is that?)
• A General Framework for Priority Arguments
• Nicht konstruktiv beweisbare Sätze der Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Recursive Real Numbers
• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• Cohesive sets and recursively enumerable Dedekind cuts
• Divergence bounded computable real numbers
• Weak computability and representation of reals
• Title not available (Why is that?)
• Computable calculus. With 1 CD-ROM (Windows 95, 98, 2000, Windows NT)
• Closure properties of real number classes under CBV functions
• Title not available (Why is that?)
• Criteria of constructibility for real numbers

Cited In (13)

• Beatty sequences and the arithmetical hierarchy
• Effective simultaneous approximability of reals.
• Title not available (Why is that?)
• Classification of the computable approximations by divergence boundings
• A hierarchy of Turing degrees of divergence bounded computable real numbers
• Title not available (Why is that?)
• Spectrum of the field of computable real numbers
• Effectively infinite classes of numberings of computable families of reals
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The approximation structure of a computably approximable real
• Computability of Real Numbers

This page was built for publication: Classification of computably approximable real numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1015380)