How much can analog and hybrid systems be proved (super-)Turing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Applied Mathematics and Computation Year : 2005

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

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.

Dates and versions

inria-00000517 , version 1 (26-10-2005)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More