|
Lecturer(s)
|
-
Kühr Jan, prof. RNDr. Ph.D.
|
|
Course content
|
1. Primitive recursion, minimization operation, recursively enumerable sets. 2. Connections between the operators of primitive recursion and minimization. 3. Total recursive functions, partial recursive functions. 4. Algorithms and Turing machines. 5. Soluble and insoluble problems. 6. Normal (Markov) algorithms.
|
|
Learning activities and teaching methods
|
|
Lecture, Dialogic Lecture (Discussion, Dialog, Brainstorming)
|
|
Learning outcomes
|
Understand fundamentals of the theory of algorithms and Turing machines.
4. Analysis Analyse questions of the existence and possibilities of general algorithms.
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Dialog
Active participation in seminars. To apply the theory in problems.
|
|
Recommended literature
|
-
Kozen D. C. (1997). Automata and Computability. Springer.
-
Malcev A. I. (1986). Algoritmy i rekursivnyje funkcii. Nauka Moskva.
|