Quiz
Which of the following is true?
- `C` language programs which compute boolean functions can be simulated by a TM, but Lisp programs cannot.
- A `k`-tape TM can always be simulated by a `1`-tape machine with at most a linear slowdown.
- Diagonalization can be used to show there exist uncomputable boolean functions.