  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.
