The Generic Model of Computation

TL;DR

This paper reviews the development of a unified axiomatic framework for algorithms using abstract state machines, extending to effective computation over arbitrary countable domains.

Contribution

It summarizes the formalization of algorithms and effective computation within the generic framework of abstract state machines, highlighting recent extensions.

Findings

Unified axiomatic foundation for classical, interactive, and parallel algorithms

Formalization of effective computation over countable domains

Extension of abstract state machines to new computational models

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.