ϵ">]>
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. Define a primitive recursive function such that
Corollary: the predicate is not computable.
Exercise. Define a primitive recursive function such that
Corollary: the predicate is not computable.
Exercise. Define primitive recursive functions and such that
Corollary: the predicate is not computable.
Exercise. Define a primitive recursive function such that
Corollary: the predicate is not computable.
Exercise. Define a primitive recursive function such that
Corollary: the predicate is not computable.
Exercise. Define a primitive recursive function such that
Corollary: the predicate is not computable.
Exercise. (1 point) Define primitive recursive functions and such that
Corollary: the predicate is not computable.
Exercise. Suppose that is an index of a unary partially computable function with a non-empty domain. Define a primitive recursive function such that
Corollary: the predicate is not computable.
Exercise. (1 point) Define a primitive recursive function such that
Corollary: the predicate is not computable.
Exercise. Define a primitive recursive function such that
Corollary: the predicate is not computable.
Exercise. Define a primitive recursive function such that
Corollary: the predicate is not computable.