Sciweavers

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

12

JC
2000

favoriteEmaildiscussreport

89views more JC 2000»

Weakly Computable Real Numbers

13 years 4 months ago

Weakly Computable Real Numbers

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

The Turing degree of a real number x is defined as the Turing degree of its binary expansion. This definition is quite natural and robust. In this paper we discuss some basic degree properties of semi-computable and weakly computable real numbers introduced by Weihrauch and Zheng [19]. Among others we show that, there are two real numbers of c.e. binary expansions such that their difference does not have an .c.e. Turing degree.

Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng

Real-time Traffic

Binary Expansions | JC 2000 | Real Numbers | Turing Degree |

claim paper

Related Content

» Groundwork for Weak Analysis

» HumanArea Segmentation by Selecting Similar Silhouette Images Based on WeakClassifier Resp...

» The computable Lipschitz degrees of computably enumerable sets are not dense

» On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases

» Bundle adjustment a fast method with weak initialisation

» Robust 3D Segmentation of Multiple Moving Objects Under Weak Perspective

» Degrees of Weakly Computable Reals

» A Generalization of Cobhams Theorem to Automata over Real Numbers

» Subclasses of the Weakly Random Reals

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	JC
Authors	Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng

Comments (0)