ϵ">]>
Literature.
[1] Downloadable lecture notes available through the web page of the course.
[2] J. Komara and P. J. Voda. Lecture Notes in Theory of Computability. 2001.
[3] P. J. Voda. Theory of Recursive Functions & Computability. 2000.
[4] I. Korec. Uvod do teorie algoritmov. MFF UK. Bratislava. 1983.
Exercise. (1 point) Find a Turing machine computing the identity function .
Hint. Start by interpreting the theory from the module Mtm. Choose non-local interpretation and set component identifier suffix to the string _i_2_2. Then follow the included instructions.