Genericity of Weakly Computable Objects
نویسندگان
چکیده
منابع مشابه
Weakly Computable Real Numbers
A real number x is recursively approximable if it is a limit of a computable sequence of rational numbers. If, moreover, the sequence is increasing (decreasing or simply monotonic), then x is called left computable (right computable or semicomputable). x is called weakly computable if it is a difference of two left computable real numbers. We show that a real number is weakly computable if and ...
متن کامل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...
متن کاملProbabilistic constructions of computable objects
A nonconstructive proof can be used to prove the existence of an object with some properties without providing an explicit example of such an object. A special case is a probabilistic proof where we show that the object with required properties appears with some positive probability in a random process. Can we use such an argument to prove the existence of a computable infinite object? Sometime...
متن کاملImpatience for Weakly Paretian Orders: Existence and Genericity
We study order theoretic and topological implications for impatience of weakly Paretian, representable orders on infinite utility streams. As a departure from the traditional literature, we do not make any continuity assumptions in proving the existence of impatient points. Impatience is robust in the sense that there are uncountably many impatient points. A general statement about genericity o...
متن کاملOn the Turing Degrees of Weakly Computable Real Numbers
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 doe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2016
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-016-9737-6