Implementation of Turing machines with the Scufl data-flow language

Tristan Glatard (1, 2) , Johan Montagnat (1)

1 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe RAINBOW
2 ASCLEPIOS - Analysis and Simulation of Biomedical Images

In this paper, the expressiveness of the simple Scufl data-flow language is studied by showing how it can be used to implement Turing machines. To do that, several non trivial Scufl patterns such as self-looping or sub-workflows are required and we precisely explicit them. The main result of this work is to show how a complex workflow can be implemented using a very simple data-flow language. Beyond that, it shows that Scufl is a Turing complete language, given some restrictions that we discuss.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Tristan Glatard, Johan Montagnat. Implementation of Turing machines with the Scufl data-flow language. Workshop on Workflow Systems in e-Science, May 2008, Lyon, France. pp.1-10. ⟨hal-00683113⟩