A dynamical system which must be stable whose stability cannot be proved

DOI10.1016/j.tcs.2004.05.001zbMath1058.37063OpenAlexW2005448406MaRDI QIDQ703488

John Foy

Publication date: 11 January 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.05.001

zbMATH Keywords

Hybrid systemsStabilityTuring machineCorrectnessPiecewise affine systemsZermelo-Frankel set theory

Mathematics Subject Classification ID

Discrete-time control/observation systems (93C55) Discrete event control/observation systems (93C65) Applications of dynamical systems (37N99) Turing machines and related notions (03D10) Proof theory and constructive mathematics (03F99)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Qualitative theory of hybrid dynamical systems.
• Stability theory for hybrid dynamical systems
• Basic problems in stability and design of switched systems
• Deciding stability and mortality of piecewise affine dynamical systems