AuDaLa is Turing Complete

TL;DR

This paper demonstrates that AuDaLa, a language based on the data autonomous paradigm, is Turing complete by implementing and verifying Turing machines within it, establishing its computational expressiveness.

Contribution

The paper introduces a verification approach for AuDaLa by implementing Turing machines and proving their correctness, showing AuDaLa's Turing completeness.

Findings

AuDaLa can simulate Turing machines

Verification of Turing machine implementations in AuDaLa is feasible

AuDaLa is proven to be Turing complete

Abstract

AuDaLa is a recently introduced programming language that follows the new data autonomous paradigm. In this paradigm, small pieces of data execute functions autonomously. Considering the paradigm and the design choices of AuDaLa, it is interesting to determine the expressiveness of the language and to create verification methods for it. In this paper, we take our first steps to such a verification method by implementing Turing machines in AuDaLa and proving that implementation correct. This also proves that AuDaLa is Turing complete.