Task 1: Boolean NOT
Construct a Turing Machine which applies the NOT-Operation to a binary number bit by bit.
Initial condition

The read/write-head starts on the right-most digit.
Final condition
The result of the operation should be written underneath the input number.
Task 2: Boolean AND
Construct a Turing Machine which calculates the bitwise AND of to binary numbers.
Initial condition

The two numbers are written beneath each other and have the same length. The read/write-head starts on the right-most digit of the upper number.
Final condition
The result of the operation should be written underneath the two input numbers.
Task 3: Boolean OR
Construct a Turing Machine which calculates the OR of to binary numbers bit by bit.
Initial condition

The two numbers are written beneath each other and have the same length. The read/write-head starts on the right-most digit of the upper number.
Final condition
The result of the operation should be written underneath the two input numbers.
Task 4: Boolean XOR
Construct a Turing Machine which calculates the XOR of to binary numbers bit by bit.
Initial condition

The two numbers are written beneath each other and have the same length. The read/write-head starts on the right-most digit of the upper number.
Final condition
The result of the operation should be written underneath the two input numbers.