If one wants to design a Turing Machine for a function such as this:
In other words, f(x; y; z) is a projection function which returns either y (if x = 0) or z (if x = 1). For other values of x; f returns 1 (an "error").
How would I erase the elements that I don't need? For example, if x=0 I only want to have y on tape, and if x = 1 have z on tape and erase the rest.
A test input to try could be: f(0; 00; 000). The numbers on tape will be in unary notations. (0 is the empty string, 1 = 0).
I am getting lost at the erasing part maybe i am wondering if some could help me out.