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 expressivity of the language. In this paper, we implement Turing machines in AuDaLa and prove that implementation correct. This proves that AuDaLa is Turing complete, giving an initial indication of AuDaLa's expressivity. Additionally, we give examples of how to add extensions to AuDaLa to increase its practical expressivity and to better match conventional parallel languages, allowing for a more straightforward and performant implementation of algorithms.

翻译：AuDaLa是一种近期提出的编程语言，遵循新的数据自主范式。在该范式中，小数据片段自主执行函数。考虑到该范式及AuDaLa的设计选择，确定该语言的表达能力具有重要意义。本文在AuDaLa中实现了图灵机，并验证了该实现的正确性。这证明了AuDaLa是图灵完备的，初步揭示了AuDaLa的表达能力。此外，我们给出了如何向AuDaLa添加扩展以提升其实用表达能力，并使其更贴近传统并行语言的示例，从而支持更直接、更高效地实现算法。