In this paper, we develop a theory of computable types suitable for the study of dynamic systems in discrete and continuous time. The theory uses type-two effectivity as the underlying computational model, but we quickly develop a type system which can be manipulated abstractly, but for which all allowable operations are guaranteed to be computable. We apply the theory to the study of differential inclusions, reachable sets and controllability.

Additional Metadata
THEME Life Sciences (theme 5), Energy (theme 4)
Publisher University of Heidelberg
Editor K. Ambos-Spies , B. Loewe , W. Merkle
Project Computational Topology for Systems and Control
Conference Computability in Europe
Citation
Collins, P.J. (2009). Computable Types for Dynamic Systems. In K Ambos-Spies, B Loewe, & W Merkle (Eds.), Mathematical Theory and Computational Practice, Fifth Conference on Computability in Europe Abstract Booklet (pp. 99–109). University of Heidelberg.

Additional Files
14682B.pdf Author Manuscript , 157kb