Axiomatizing Analog Algorithms
Logic in Computer Science
2020-06-11 v2
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
@article{arxiv.1604.04295,
title = {Axiomatizing Analog Algorithms},
author = {Olivier Bournez and Nachum Dershowitz and Pierre Néron},
journal= {arXiv preprint arXiv:1604.04295},
year = {2020}
}