On the Weak Computability of Continuous Real Functions
نویسندگان
چکیده
منابع مشابه
On the Weak Computability of Continuous Real Functions
In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (ρ-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there is a Turing machine M which computes f in the sense that, M accepts any ρ-name of x as input and outputs a ρ-name of f (x) for any x in the domain of f . By wea...
متن کاملThe ring of real-continuous functions on a topoframe
A topoframe, denoted by $L_{ tau}$, is a pair $(L, tau)$ consisting of a frame $L$ and a subframe $ tau $ all of whose elements are complementary elements in $L$. In this paper, we define and study the notions of a $tau $-real-continuous function on a frame $L$ and the set of real continuous functions $mathcal{R}L_tau $ as an $f$-ring. We show that $mathcal{R}L_{ tau}$ is actually a generali...
متن کاملComputability on Continuou, Lower Semi-continuous and Upper Semi-continuous Real Functions
In this paper we investigate continuous and upper and lower semi-continuous real functions in the framework of TTE, Type-2 Theory of EEectivity. First some basic facts about TTE are summarized. For each of the function spaces, we introduce several natural representations based on diierent intiuitive concepts of \eeectivity" and prove their equivalence. Computability of several operations on the...
متن کاملWeak Computability and Representation of Real Numbers
Analogous to Ershov’s hierarchy for ∆2-subsets of natural numbers we discuss the similar hierarchy for recursively approximable real numbers. Namely, we define the k-computability for natural number k and f -computability for function f . We will show that these notions are not equivalent for different representations of real numbers based on Cauchy sequence, Dedekind cut and binary expansion.
متن کاملOn Some Computability Notions for Real Functions
A widely used approach to computability of real functions is the one in Grzegorczyk’s style originating from [1]. This approach uses computable transformations of infinitistic names of real numbers, as well as general quantifiers over these names. Other approaches allow avoiding the use of such names at least in some cases. An approach of this other kind is, for instance, the one of Tent and Zi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2010
ISSN: 2075-2180
DOI: 10.4204/eptcs.24.8