Evolving Algebras 1993: Lipari Guide

08/19/2018
by   Yuri Gurevich, et al.
0

Computation models and specification methods seem to be worlds apart. The project on abstract state machines (in short ASMs, also known as evolving algebras) started as an attempt to bridge the gap by improving on Turing's thesis. We sought more versatile machines which would be able to step-for-step simulate arbitrary algorithms on their natural abstraction levels. The ASM thesis asserts that ASMs are such versatile machines. The guide provides the definitions of sequential, parallel and distributed ASMs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/18/2022

Turing Machines cannot simulate the human mind

Can a Turing Machine simulate the human mind? If the Church-Turing thesi...
research
02/08/2020

Means-fit effectivity

Historically, the notion of effective algorithm is closely related to th...
research
07/01/2021

Addressing Machines as models of lambda-calculus

Turing machines and register machines have been used for decades in theo...
research
08/30/2019

How Relevant is the Turing Test in the Age of Sophisbots?

Popular culture has contemplated societies of thinking machines for gene...
research
11/12/2021

Multiway Storage Modification Machines

We present a parallel version of Schönhage's Storage Modification Machin...
research
05/12/2021

Reversify any sequential algorithm

To reversify an arbitrary sequential algorithm A, we gently instrument A...
research
05/02/2019

Space-bounded Church-Turing thesis and computational tractability of closed systems

We report a new limitation on the ability of physical systems to perform...

Please sign up or login with your details

Forgot password? Click here to reset