Problem sheet 7 for 0028
Due at noon, Wednesday Dec 4, 2019,
in the box marked 0028 in Room 502.
Only questions 2, 3, and 4 will be assessed.
1. Give an instance of the stable matching problem with non-unique
stable matching.
2. Design an algorithm that decides whether an instance of the stable
matching problem has a unique solution.
3. Describe informally the Turing machine that decides if $a = b$ when $a$, $b$
are positive integers. Give the first three moves formally.
4. Describe informally the Turing machine that computes the remainder
modulo 4 of a positive integer $n$ which is given as a binary string $s$. Give
also the first two moves formally.