Expressivity of AuDaLa: Turing completeness and possible extensions

DOI10.46298/LMCS-22(2:5)2026MaRDI QIDQ7254981zbMATH OpenFDO

Authors Tom T. P. Franken, Thomas Neele

Publication date 29 May 2026

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-22(2:5)2026

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• A sound and complete abstraction for reasoning about parallel prefix sums
• An autonomous data language
• Decidability problems for actor systems
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• The autonomous data language -- concepts, design and formal verification
• Turing completeness of water computing

This page was built for publication: Expressivity of AuDaLa: Turing completeness and possible extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254981)