We define a case of recursive functions on the reals analogous to the classical recursive functions on the natural numbers, corresponding to a conceptual analog computer that operates in continuous time. This class turns out to be surprisingly large, and includes many functions which are uncomputable in the traditional sense.
We stratify this class of functions into a hierarchy, according to the number of uses of the zero-finding operator mu. At the lowest level are continuous functions that are differentially algebraic, and computable by Shannon's General Purpose Analog Computer. At higher levels are increasingly discontinuous and complex functions. We relate this mu-hierarchy to the Arithmetical and Analytical Hierarchies of classical recursion theory.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
Publisher Info
Paper provided by Santa Fe Institute in its series Working Papers with number
95-09-079.
Did you know? You can create a compilation of all publications of a group of people, say alumni of a program, your students or memers of an association.