Classification of computably approximable real numbers

DOI10.1007/S00224-007-9026-5MaRDI QIDQ1015380zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3117565 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (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 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1796999 (Why is no real title available?)
• scientific article; zbMATH DE number 2204767 (Why is no real title available?)
• scientific article; zbMATH DE number 3342830 (Why is no real title available?)
• scientific article; zbMATH DE number 3083488 (Why is no real title available?)
• A General Framework for Priority Arguments
• Closure properties of real number classes under CBV functions
• Cohesive sets and recursively enumerable Dedekind cuts
• Computable calculus. With 1 CD-ROM (Windows 95, 98, 2000, Windows NT)
• Constructive mathematics: a foundation for computable analysis
• Criteria of constructibility for real numbers
• Divergence bounded computable real numbers
• Nicht konstruktiv beweisbare Sätze der Analysis
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Recursive Real Numbers
• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Weak computability and representation of reals
• Weakly computable real numbers

Cited in

(13)

• scientific article; zbMATH DE number 1183247 (Why is no real title available?)
• scientific article; zbMATH DE number 1747708 (Why is no real title available?)
• Effectively infinite classes of numberings of computable families of reals
• scientific article; zbMATH DE number 1850721 (Why is no real title available?)
• Beatty sequences and the arithmetical hierarchy
• scientific article; zbMATH DE number 3954906 (Why is no real title available?)
• A hierarchy of Turing degrees of divergence bounded computable real numbers
• Spectrum of the field of computable real numbers
• Computability of Real Numbers
• Classification of the computable approximations by divergence boundings
• scientific article; zbMATH DE number 1665454 (Why is no real title available?)
• Effective simultaneous approximability of reals.
• The approximation structure of a computably approximable real

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)