ϵ">]>
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] J. Komara and P. J. Voda. Metamathematics of Computer Programming. 2001.
Derive Fibonacci sequence as a p.r. function by showing that the function
is primitive recursive.
Exercise. (1 point) Consider the binary predicate which holds if the number is the code of an -tuple. Note that this includes the case when or . Show that the predicate is primitive recursive.