Oxford Journals
tools journals homepage advanced search contact help
Journal of Logic and Computation: Current Issue
 
home
browse
current
etoc
authors
subinfo
subscribers
samples

OUP > Journals > Computing/Engineer. & Mathematics/Stats. > Journal of Logic and Computation

Journal of Logic and Computation

Volume 13, Issue 2, April 2003: pp. 159-172

On the Turing Degrees of Weakly Computable Real Numbers

Xizhong Zheng1

1Theoretische Informatik, BTU Cottbus, 03044 Cottbus, Germany. E-mail: zheng@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. We show that there are two real numbers of c.e. binary expansions such that their difference does not have an [ohgr].c.e. Turing degree.

Keywords: Weakly computable real number; Turing degree of real number

Table of Contents   Full-Text PDF (176 KB)

Oxford University Press
Published by Oxford University Press
Copyright ©Oxford University Press 2003
Print ISSN: 0955-792X  Online ISSN: 1465-363X.
Oxford University Press Privacy Policy and Legal Statement