The Generic Model of Computation
Open Access
- 30 July 2012
- journal article
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 88, 59-71
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.Comment: In Proceedings DCM 2011, arXiv:1207.682Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Abstract state machines capture parallel algorithmsACM Transactions on Computational Logic, 2008
- Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization TheoremLogical Methods in Computer Science, 2007
- Interactive Small-Step Algorithms I: AxiomatizationLogical Methods in Computer Science, 2007
- Ordinary interactive small-step algorithms, IIIACM Transactions on Computational Logic, 2007
- Ordinary interactive small-step algorithms, IIACM Transactions on Computational Logic, 2007
- Ordinary interactive small-step algorithms, IACM Transactions on Computational Logic, 2006
- Semantic essence of AsmLTheoretical Computer Science, 2005
- Sequential abstract-state machines capture sequential algorithmsACM Transactions on Computational Logic, 2000
- A mathematical definition of full PrologScience of Computer Programming, 1995
- Algorithm 4Communications of the ACM, 1960