<M,w,k in unary notation> —-> <M,w,k in binary notation>

The conversion from unary notation to binary notation is an easy and efficient (in the unary length of k)

algorithm, so indeed in poly time. The other direction is clearly **not** in poly time as the output length

(unary representation of k) is exponentially longer than the input length (binary representation).

Safe and sound.

]]>f: <M,w,k> —-> <M,w,logk>?

Meaning, M accepts w in k steps if and only if M accepts w in 2^logk step?

the only thing that bothers me is whether taking log out of k can be done in polynomial time (which I think so, but better safe than sorry)…

Thanks!

]]>