Iteration, Inequalities, and Differentiability in Analog Computers
Shannon's General Purpose Analog Computer (GPAC) is an elegant model of analog computation in continuous time. In this paper, we consider whether the set G of GPAC-computable functions is closed under iteration, that is, whether for any function f(x) 2 G there is a function F(x; t) 2 G such that F(x; t) = f t (x) for non-negative integers t. We show that G is not closed under iteration, but a simple extension of it is. In particular, if we relax the definition of the GPAC slightly to include unique solutions to boundary value problems, or equivalently if we allow functions x k f(x) that sense inequalities in a differentiable way, the resulting class, which we call G + fk, is closed under iteration. Furthermore, G + k includes all primitive recursive functions, and has the additional closure property that if T(x) is in G + k, then any function of x computable by a Turing machine in T(x) time is also.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
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.
|Date of creation:||Jul 1999|
|Date of revision:|
|Contact details of provider:|| Postal: 1399 Hyde Park Road, Santa Fe, New Mexico 87501|
Web page: http://www.santafe.edu/sfi/publications/working-papers.html
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:wop:safiwp:99-07-043. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.