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.

翻译：AuDaLa 是一种近期提出的编程语言，遵循新型数据自主范式。在该范式中，小型数据片段自主执行函数。基于该范式及AuDaLa的设计选择，确定该语言的表达能力并为其创建验证方法颇具研究价值。本文通过在图灵机中实现AuDaLa并证明该实现的正确性，迈出了构建此类验证方法的第一步。该研究同时证明了AuDaLa是图灵完备的。