Mathematical logic quarterly · 2002 · 33 citations · 22 references
ComputingComputer ScienceMathematicsAlgorithmsTheory Of ComputationApproximation AlgorithmsApproximation MethodsChurch-turing ThesisNumerical AlgorithmsRecurrence RelationsRecursion TheoryApproximation TheoryReal NumbersRecursion TheoremRecursive FunctionsSuccessive Approximations
A real number is recursively approximable if there is a computable sequence of rational numbers converging to it. If some extra condition to the convergence is added, then the limit real number might have more effectivity. In this note we summarize some recent attempts to classify the recursively approximable real numbers by the convergence rates of the corresponding computable sequences ofr ational numbers.
22
Recursively enumerable sets and degrees
Robert I. Soare · Bulletin of the American Mathematical Society · 1978 · 1.6K citations · Full text
The definition of random sequences
Per Martin-Löf · Information and Control · 1966 · 1.2K citations