HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

How much can analog and hybrid systems be proved (super-)Turing

Olivier Bournez 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Church thesis and its variants say roughly that all reasonable models of computation do not have more power than Turing Machines. In a contrapositive way, they say that any model with super-Turing power must have something unreasonable. Our aim is to discuss how much theoretical computer science can quantify this, by considering several classes of continuous time dynamical systems, and by studying how much they can be proved Turing or super-Turing.
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/inria-00000517
Contributor : Olivier Bournez Connect in order to contact the contributor
Submitted on : Wednesday, October 26, 2005 - 6:58:30 PM
Last modification on : Friday, May 13, 2022 - 10:18:04 PM

Identifiers

Collections

Citation

Olivier Bournez. How much can analog and hybrid systems be proved (super-)Turing. Applied Mathematics and Computation, Elsevier, 2005, ⟨10.1016/j.amc.2005.09.070⟩. ⟨inria-00000517⟩

Share

Metrics

Record views

81