Abstract
We propose a formalization of generic algorithms that includes analog algorithms. This is achieved by reformulating and extending the framework of abstract state machines to include continuous-time models of computation. We prove that every hybrid algorithm satisfying some reasonable postulates may be expressed precisely by a program in a simple and expressive language.
Cite
CITATION STYLE
Bournez, O., Dershowitz, N., & Néron, P. (2016). Axiomatizing analog algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9709, pp. 215–224). Springer Verlag. https://doi.org/10.1007/978-3-319-40189-8_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
