Advanced Search
MyIDEAS: Login to save this paper or follow this series

An Analog Characterization of the Subrecursive Functions


Author Info

  • Manuel Lameiras Campagnolo
  • Cristopher Moore
  • José Félix Costa
Registered author(s):


    We study a restricted version of Shannon's General Purpose Analog Computer in which we only allow the machine to solve linear differential equations. This corresponds to only allowing local feedback in the machine's variables. We show that if this computer is allowed to sense inequalities in a differentiable way, then it can compute exactly the elementary functions. Furthermore, we show that if the machine has access to an oracle which computes a function f(x) with a suitable growth as x goes to infinity, then it can compute functions on any given level of the Grzegorczyk hierarchy. More precisely, we show that the model contains exactly the nth level of the Grzegorczyk hierarchy if it is allowed to solve n-3 non-linear differential equations of a certain kind. Therefore, we claim that there is a close connection between analog complexity classes, and the dynamical systems that compute them, and classical sets of subrecursive functions.

    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.

    Bibliographic Info

    Paper provided by Santa Fe Institute in its series Working Papers with number 00-01-005.

    as in new window
    Date of creation: Jan 2000
    Date of revision:
    Handle: RePEc:wop:safiwp:00-01-005

    Contact details of provider:
    Postal: 1399 Hyde Park Road, Santa Fe, New Mexico 87501
    Web page:
    More information through EDIRC

    Related research

    Keywords: Analog computation; differential equations and recursion theory.;

    This paper has been announced in the following NEP Reports:


    No references listed on IDEAS
    You can help add them by filling out this form.


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Manuel Campagnolo & Cristopher Moore, 2000. "Upper and Lower Bounds on Continuous-Time Computation," Working Papers 00-06-030, Santa Fe Institute.


    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    When requesting a correction, please mention this item's handle: RePEc:wop:safiwp:00-01-005. 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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.