Weakly computable real numbers (Q5925970): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1006/jcom.2000.0561 / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2007775665 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Δ 2 0 -Mengen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4381402 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5626633 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Degrees of unsolvability complementary between recursively enumerable degrees, Part 1 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semirecursive Sets and Positive Reducibility / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the definitions of some complexity classes of real numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursive real numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursive Real Numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5805955 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3819052 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cohesive sets and recursively enumerable Dedekind cuts / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nicht konstruktiv beweisbare Sätze der Analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4485693 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1006/JCOM.2000.0561 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:35, 8 December 2024
scientific article; zbMATH DE number 1574329
Language | Label | Description | Also known as |
---|---|---|---|
English | Weakly computable real numbers |
scientific article; zbMATH DE number 1574329 |
Statements
Weakly computable real numbers (English)
0 references
29 May 2001
0 references
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.
0 references
computable reals
0 references
Cauchy sequences
0 references
computable sequence of rationals
0 references
effective convergence
0 references
field of d.c.e reals
0 references
0 references