# Evolving Algebras 1993: Lipari Guide

arXiv: https://arxiv.org/abs/1808.06255 · HTML: https://mlsanity.com/paper/1808.06255/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 19 Aug 2018.

## Built on by (most cited first, 2 of 2)

- [Can Transformers Learn to Solve Problems Recursively?](https://mlsanity.com/paper/2305.14699/) (2023)
- [Basic interactive algorithms: Preview](https://mlsanity.com/paper/2508.05798/) (2025)

## Abstract (arXiv)

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.