In this talk, we will present a procedure that shows that every Turing machine can be simulated by an analytic map, in an error-robust manner. We also show that these maps can be explicitly obtained. We end the session with some considerations about the possibility of using noise to perform simulations of non-deterministic Turing machines.