The Generic Model of Computation
Logic in Computer Science
2012-08-14 v1 Programming Languages
Abstract
Over the past two decades, Yuri Gurevich and his colleagues have formulated axiomatic foundations for the notion of algorithm, be it classical, interactive, or parallel, and formalized them in the new generic framework of abstract state machines. This approach has recently been extended to suggest a formalization of the notion of effective computation over arbitrary countable domains. The central notions are summarized herein.
Cite
@article{arxiv.1208.2585,
title = {The Generic Model of Computation},
author = {Nachum Dershowitz},
journal= {arXiv preprint arXiv:1208.2585},
year = {2012}
}
Comments
In Proceedings DCM 2011, arXiv:1207.6821