Weakly computable real numbers

DOI10.1006/JCOM.2000.0561zbMath0974.03054OpenAlexW2007775665MaRDI QIDQ5925970

Ambos-Spies, Klaus, Weihrauch, Klaus, Zheng, Xizhong

Publication date: 29 May 2001

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8dbff08eff07df1dd342b42b3f07d81238d351e2

zbMATH Keywords

Cauchy sequencescomputable realscomputable sequence of rationalseffective convergencefield of d.c.e reals

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60)

Related Items (21)

Randomness and reducibility ⋮ NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES ⋮ A hierarchy of Turing degrees of divergence bounded computable real numbers ⋮ Differences of halting probabilities ⋮ Fixed-parameter decidability: Extending parameterized complexity analysis ⋮ A Note on the Differences of Computably Enumerable Reals ⋮ On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals ⋮ On the hierarchy and extension of monotonically computable real numbers. ⋮ Finitely Bounded Effective Computability ⋮ Classification of the Computable Approximations by Divergence Boundings ⋮ RECOGNIZING STRONG RANDOM REALS ⋮ Directional dynamics along arbitrary curves in cellular automata ⋮ On the hierarchies of Δ₂⁰-real numbers ⋮ 2004 Annual Meeting of the Association for Symbolic Logic ⋮ Relative randomness and real closed fields ⋮ Classification of computably approximable real numbers ⋮ Asymptotic density and the Ershov hierarchy ⋮ SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS ⋮ The closure properties on real numbers under limits and computable operators. ⋮ Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers ⋮ Divergence bounded computable real numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cohesive sets and recursively enumerable Dedekind cuts
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• On the definitions of some complexity classes of real numbers
• Δ 2 0 -Mengen
• Semirecursive Sets and Positive Reducibility
• Recursive real numbers
• Degrees of unsolvability complementary between recursively enumerable degrees, Part 1
• Nicht konstruktiv beweisbare Sätze der Analysis
• Recursive Real Numbers

This page was built for publication: Weakly computable real numbers