1. Write a Turing machine that takes as input a binary number a (a string in “0” and “1”) and outputs a − 1 (in binary). Be careful to specify the alphabet and all instructions.
2. Let is a Turing machine .
Find a function f : T → N such that if N and M are Turing machines and f(N) = f(M) then N = M (that is, N and M have the same alphabet, same transition function, etc.).
