Effectively closed sets and graphs of computable real functions
نویسندگان
چکیده
منابع مشابه
Effectively closed sets and graphs of computable real functions
In this paper, we compare the computability and complexity of a continuous real function F with the computability and complexity of the graph G of the function F . A similar analysis will be carried out for functions on subspaces of the real line such as the Cantor space, the Baire space and the unit interval. In particular, we de1ne four basic types of e"ectively closed sets C depending on whe...
متن کاملEffectively closed sets and enumerations
An effectively closed set, or Π 1 class, may viewed as the set of infinite paths through a computable tree. A numbering, or enumeration, is a map from ω onto a countable collection of objects. One numbering is reducible to another if equality holds after the second is composed with a computable function. Many commonly used numberings of Π 1 classes are shown to be mutually reducible via a compu...
متن کاملEffectively closed sets of measures and randomness
We show that if a real x ∈ 2 is strongly Hausdorff Hh-random, where h is a dimension function corresponding to a convex order, then it is also random for a continuous probability measure μ such that the μ-measure of the basic open cylinders shrinks according to h. The proof uses a new method to construct measures, based on effective (partial) continuous transformations and a basis theorem for Π...
متن کاملA Data Model for Effectively Computable Functions
Searching for a better data model would continue unless a satisfaction was reached. Improving the productivity and quality of developing traditional and emerging database applications is the motivation driving the research activities. This abstract is to introduce the approach of a data model EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectively compu...
متن کاملPredicatively computable functions on sets
Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable set functions. Each function in this class is polynomial time computable when we restrict to finite binary strings.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00069-x