Abstract State Machines: a unifying view of models of computation and of system design frameworks

Annals of Pure and Applied Logic 133 (1-3):149-171 (2005)
  Copy   BIBTEX

Abstract

We capture the principal models of computation and specification in the literature by a uniform set of transparent mathematical descriptions which—starting from scratch—provide the conceptual basis for a comparative study.1

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2004.10.007

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Choiceless polynomial time.Andreas Blass, Yuri Gurevich & Saharon Shelah - 1999 - Annals of Pure and Applied Logic 100 (1-3):141-187.
A (Basis for a) Philosophy of a Theory of Fuzzy Computation.Apostolos Syropoulos - 2018 - Kairos 20 (1):181-201.
Hod In Natural Models Of Ad+.Nam Trang - 2014 - Annals of Pure and Applied Logic 165 (10):1533-1556.
Continuous formal systems: A unifying model in language and cognition.Bruce J. MacLennan - unknown
Introduction to Turing categories.J. Robin B. Cockett & Pieter Jw Hofstra - 2008 - Annals of Pure and Applied Logic 156 (2):183-209.
Symbols, neurons, soap-bubbles and the neural computation underlying cognition.Robert W. Kentridge - 1994 - Minds and Machines 4 (4):439-449.
Recursive properties of relations on models.Geoffrey R. Hird - 1993 - Annals of Pure and Applied Logic 63 (3):241-269.
Logic, language, information and computation.Ruy de Queiroz & Angus Macintyre - 2008 - Annals of Pure and Applied Logic 152 (1):1-2.
Explicit mathematics: power types and overloading.Thomas Studer - 2005 - Annals of Pure and Applied Logic 134 (2-3):284-302.
Transcending Turing computability.B. J. Maclennan - 2003 - Minds and Machines 13 (1):3-22.

Analytics

Added to PP
2013-11-23

Downloads
18 (#828,658)

6 months
3 (#1,208,833)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Computability, complexity, logic.Egon Börger - 1989 - New York, N.Y., U.S.A.: Elsevier Science Pub. Co..
Grammar formalisms viewed as evolving algebras.David E. Johnson & Lawrence S. Moss - 1994 - Linguistics and Philosophy 17 (6):537 - 560.

Add more references