The AuDaLa programming language, which follows the data autonomous paradigm, is proven to be Turing complete by implementing a Turing machine in AuDaLa.
