Computability of the entropy of one-tape Turing Machines

Emmanuel Jeandel

We prove that the maximum speed and the entropy of a one-tape Turing machine are computable, in the sense that we can approximate them to any given precision $\epsilon$. This is contrary…