Towards an Axiomatization of Simple Analog Algorithms

Olivier Bournez (1) , Nachum Dershowitz (2) , Evgenia Falkovich (2)

1 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
2 TAU-CS - School of Computer Science

We propose a formalization of analog algorithms, extending the framework of abstract state machines to continuous-time models of computation.

Domains: Computational Complexity [cs.CC]

Olivier Bournez, Nachum Dershowitz, Evgenia Falkovich. Towards an Axiomatization of Simple Analog Algorithms. Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings, Date-Added = 2012-05-04 20:32:53 +0000, Date-Modified = 2012-05-04 20:35:01 +0000, 2012, China. pp.525-536. ⟨hal-00760736⟩