Weakly computable real numbers
The authors look at Cauchy sequences converging to real numbers and their effectiveness. If one has a computable sequence of rationals monotonically increasing to a real \(\alpha\) then the real is called left computable (or elsewhere, computably enumerable), (and similarly right computable). The real may not be computable as there is no guaranteed effective convergence ratio. If the sequence is not monotone then the real which is its limit is \(\Delta^0_2\). The authors show that if we define a real to be d.c.e. when it is the arithmetic difference of two left computable reals, then this set forms a field, and hence the ``difference hierarchy for reals stops at two. It is also shown that the class of left or right computable reals, the class of d.c.e. reals, and the class of \(\Delta^0_2\) reals are all distinct. In a later paper (Proceedings COCOON'01) functions based on the field of d.c.e reals are examined.
- Cohesive sets and recursively enumerable Dedekind cuts
- Degrees of unsolvability complementary between recursively enumerable degrees, Part 1
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 1136091 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3351541 (Why is no real title available?)
- scientific article; zbMATH DE number 3066801 (Why is no real title available?)
- Nicht konstruktiv beweisbare Sätze der Analysis
- On the definitions of some complexity classes of real numbers
- Recursive real numbers
- Recursive Real Numbers
- Semirecursive Sets and Positive Reducibility
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Δ 2 0 -Mengen
- Classification of computably approximable real numbers
- On the hierarchy and extension of monotonically computable real numbers.
- The closure properties on real numbers under limits and computable operators.
- Randomness and reducibility
- On the differences and sums of strongly computably enumerable real numbers
- Differences of halting probabilities
- Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers
- The Arithmetical Hierarchy of Real Numbers
- scientific article; zbMATH DE number 1665454 (Why is no real title available?)
- 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
- Weak computability and representation of reals
- 2004 Annual Meeting of the Association for Symbolic Logic
- Relative randomness and real closed fields
- Recognizing strong random reals
- On the complexity of computable real sequences
- On the Turing Degrees of Weakly Computable Real Numbers
- scientific article; zbMATH DE number 1747708 (Why is no real title available?)
- scientific article; zbMATH DE number 1746031 (Why is no real title available?)
- scientific article; zbMATH DE number 1796999 (Why is no real title available?)
- h-monotonically computable real numbers
- scientific article; zbMATH DE number 1834682 (Why is no real title available?)
- On 0'-computable reals
- Finitely bounded effective computability
- Classification of the computable approximations by divergence boundings
- scientific article; zbMATH DE number 1405689 (Why is no real title available?)
- scientific article; zbMATH DE number 1418324 (Why is no real title available?)
- SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS
- NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES
- Asymptotic density and the Ershov hierarchy
- Beatty sequences and the arithmetical hierarchy
- On the hierarchies of Δ20-real numbers
- Directional dynamics along arbitrary curves in cellular automata
- Logical Approaches to Computational Barriers
- The optimal causal linear predictor is not Turing computable
- Divergence bounded computable real numbers
- A hierarchy of Turing degrees of divergence bounded computable real numbers
- A c.e. real that cannot be sw-computed by any \(\Omega\) number
This page was built for publication: Weakly computable real numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925970)
