Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

MLQ
2002

favoriteEmaildiscussreport

75views more MLQ 2002»

Recursive Approximability of Real Numbers

13 years 10 months ago

Recursive Approximability of Real Numbers

Download www-sst.informatik.tu-cottbus.de

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 of rational numbers and arithmetical reals. Mathematics Subject Classification: 03F60, 26E40, 03D80.

Xizhong Zheng

Real-time Traffic

Computable Sequences | MLQ 2002 | Rational Numbers | Real Numbers |

claim paper

Related Content

» The elementary computable functions over the real numbers applying two new techniques

» Recursive Analysis Characterized as a Class of Real Recursive Functions

» An Analog Characterization of Elementarily Computable Functions over the Real Numbers

» A Reduced Complexity Algorithm for Minimizing NDetect Tests

» Stability for Effective Algebras

» Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras

» UnderApproximations of Computations in Real Numbers Based on Generalized Affine Arithmetic

» Recursive in A Generic Real

» A proof of completeness for continuous firstorder logic

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	MLQ
Authors	Xizhong Zheng

Comments (0)