Analog computers and recursive functions over the reals
نویسندگان
چکیده
In this paper we show that Shannon’s General Purpose Analog Computer (GPAC) is equivalent to a particular class of recursive functions over the reals with the flavour of Kleene’s classical recursive function theory. We first consider the GPAC and several of its extensions to show that all these models have drawbacks and we introduce an alternative continuous-time model of computation that solves these problems. We also show that this new model preserves all the significant relations involving the previous models (namely, the equivalence with the differentially algebraic functions). We then continue with the topic of recursive functions over the reals, and we show full connections between functions generated by the model introduced so far and a particular class of recursive functions over the reals.
منابع مشابه
Implicit complexity in recursive analysis
Recursive analysis is a model of analog computation which is based on type 2 Turing machines. Various classes of functions computable in recursive analysis have recently been characterized in a machine independent and algebraical context. In particular nice connections between the class of computable functions (and some of its sub and supclasses) over the reals and algebraically defined (suband...
متن کاملUsing Approximation to Relate Computational Classes over the Reals
We use our method of approximation to relate various classes of computable functions over the reals. In particular, we compare Computable Analysis to the two analog models, the General Purpose Analog Computer and Real Recursive Functions. There are a number of existing results in the literature showing that the different models correspond exactly. We show how these exact correspondences can be ...
متن کاملReal recursive functions and their hierarchy
In the last years, recursive functions over the reals (Theoret. Comput. Sci. 162 (1996) 23) have been 9 considered, first as a model of analog computation, and second to obtain analog characterizations of classical computational complexity classes (Unconventional Models of Computation, UMC 2002, 11 Lecture Notes in Computer Science, Vol. 2509, Springer, Berlin, pp. 1–14). However, one of the op...
متن کاملAlgebraic Characterizations of Complexity-Theoretic Classes of Real Functions
Recursive analysis is the most classical approach to model and discuss computations over the real numbers. Recently, it has been shown that computability classes of functions in the sense of recursive analysis can be defined (or characterized) in an algebraic machine independent way, without resorting to Turing machines. In particular nice connections between the class of computable functions (...
متن کاملThe Complexity of Real Recursive Functions
We explore recursion theory on the reals, the analog counterpart of recursive function theory. In recursion theory on the reals, the discrete operations of standard recursion theory are replaced by operations on continuous functions, such as composition and various forms of differential equations. We define classes of real recursive functions, in a manner similar to the classical approach in re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Complexity
دوره 19 شماره
صفحات -
تاریخ انتشار 2003