References & Citations
Computer Science > Programming Languages
Title: AuDaLa is Turing Complete
(Submitted on 19 Apr 2024 (v1), last revised 22 Apr 2024 (this version, v2))
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.
Submission history
From: Tom T.P. Franken MSc [view email][v1] Fri, 19 Apr 2024 15:05:25 GMT (20kb)
[v2] Mon, 22 Apr 2024 09:19:30 GMT (20kb)
Link back to: arXiv, form interface, contact.