We present a graphical simulator of 1-Tape, k-Tapes, deterministic and non deterministic Turing machines. The simulator is written in Java and as such it runs on most platforms. During and after the computation it returns interesting features such as the amount of space visited/used and the number of steps. When simulating non-deterministic Turing machines it allows to browse the “tree” of non deterministic computations. It is developed purely for didactic purposes: it can be used in courses of Foundations of Computer Science, in courses of Computational Complexity, as well as in didactic projects with high schools.
