IDEAS home Printed from https://ideas.repec.org/p/wop/safiwp/00-06-030.html
   My bibliography  Save this paper

Upper and Lower Bounds on Continuous-Time Computation

Author

Listed:
  • Manuel Campagnolo
  • Cristopher Moore

Abstract

We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuous time. We show that several classical computation classes have natural analog counterparts, including the primitive recursive functions, the elementary functions, the levels of the Grzegorczyk hierarchy, and the arithmetical and analytical hierarchies.

Suggested Citation

  • Manuel Campagnolo & Cristopher Moore, 2000. "Upper and Lower Bounds on Continuous-Time Computation," Working Papers 00-06-030, Santa Fe Institute.
    • Handle: RePEc:wop:safiwp:00-06-030
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below 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.

    References listed on IDEAS

    as
    1. Manuel Lameiras Campagnolo & Cristopher Moore & José Félix Costa, 2000. "An Analog Characterization of the Subrecursive Functions," Working Papers 00-01-005, Santa Fe Institute.
    2. Vergis, Anastasios & Steiglitz, Kenneth & Dickinson, Bradley, 1986. "The complexity of analog computation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 28(2), pages 91-113.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Manuel Lameiras Campagnolo & Cristopher Moore & José Félix Costa, 1999. "Iteration, Inequalities, and Differentiability in Analog Computers," Working Papers 99-07-043, Santa Fe Institute.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wop:safiwp:00-06-030. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thomas Krichel (email available below). General contact details of provider: https://edirc.repec.org/data/epstfus.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.