-
@stmanfr This is equivalent. Stritcly equivalent. This is mathematically proved.
-
@stmanfr The only assumption for that is finished memory. And this is the case in practice for computers.
-
@stmanfr Mathematically, Turing machine with finished memory = finished state machine with memory tape = lambda calculus with well formed expression