Representation of left-computable ε-random reals

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representation of left-computable ε-random reals

Article history: Received 5 June 2009 Received in revised form 25 July 2010 Accepted 4 August 2010 Available online 10 August 2010

متن کامل

Computable functions of reals

We introduce a new notion of computable function on R and prove some basic properties. We give two applications, first a short proof of Yoshinaga’s theorem that periods are elementary (they are actually lower elementary). We also show that the lower elementary complex numbers form an algebraically closed field closed under exponentiation and some other special functions.

متن کامل

Degrees of Weakly Computable Reals

A real α is left-recursively enumerable (left-r.e. for short) if we can effectively generate α from below. That is, the left Dedkind cut of α, L(α) = {q ∈ Q : q ≤ α}, forms a r.e. set. Equivalently, a real α is left-r.e. if it is the limit of a converging recursive increasing sequence. If we can also compute the radius of convergence effectively, then α is recursive. Left-r.e. reals are the mea...

متن کامل

Polynomial-time hierarchy of computable reals

In mathematics, various representations of real numbers have been investigated and all these representations are proved to be mathematically equivalent. Furthermore, it is known that all effective versions of these representations lead to the same class of “computable real numbers”. However, when subrecursive (such as primitive recursive) is taken into account, these representations can lead to...

متن کامل

Recognizing Strong Random Reals

The class of strong random reals can be defined via a natural conception of effective null set. We show that the same class is also characterized by a learning-theoretic criterion of ‘recognizability’. 1. Characterizing randomness. Consider a physical process that, if suitably idealized, generates an indefinite sequence of independent random bits. One such process might be radioactive decay of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 2011

ISSN: 0022-0000

DOI: 10.1016/j.jcss.2010.08.001