1. Design Turing Maching M for

 f(x) = 1 if x> y       is computable x,y is integer

         0 if x<=y

- input : x0y
- output : 1 or 0


2. Attacking Problem

    Repeat
    Match a 1 from x with a 1 from y
    Until all x or y has been matched

    If a 1 from x is not matched
     erase tape, write 1
    else
          erase tape, write 0



문제는 위의 2개인데, 1번은 코드로 쓰고 2번은 그림으로 나타내야 함