Evolving Algebras 1993: Lipari Guide
Not on the map. Why?
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.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 19 Aug 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.
- 2023Can Transformers Learn to Solve Problems Recursively?cited by 17
- 2025Basic interactive algorithms: Previewcited by 0
- 2025Basic interactive algorithms: Preview7 Aug 2025
- 2023Can Transformers Learn to Solve Problems Recursively?24 May 2023