Models of Computation
Lecture: Tuesday 14:15 - 15:45, room -1.64, north builing
Practice class: Tuesday 16:00 - 17:30, room -1.64, north builing
Classical models of computing: finite automata, pushdown automata,
Turing machines(TM), variants of TMs, partial recursive functions,
undecidability, time and space complexity, random access machines (RAM), circuits, cellular automata.
Models of parallel and distributed computing. Unconventional models of computing (natural computing).
1. Active partitipation and work in pactice classes: solving and discussing excercises
2. passing >=50% of the 10 min. tests at the beginning of the practice classes
3. Successful exams (grade is computed as average of 2 exams)
- midterm test/exam (written): 2022-10-18
- final test/exam (written): 2022-11-22
- repeat exam (second trial exam in case of unsuccessful exam): 2022-11-29
| 1. Introduction
| 2. Grammars
| 3. Grammars, L-systems
| 4. Regular expressions, finite automata
| 5. Finite automata, DFA, NFA, minimal DFA
| 6. Probabilistic automata, Pushdown automata, Context-free languages
| 7. Turing machines, Variants, Church-Turing thesis, Recursively enumerable languages
| 8: Diagonalization, Decision problems, undecidability
J. E. Savage, Models of Computation: Exploring the Power of Computing,
Brown University, 1998.
M. Sipser, Introduction to the Theory of Computation, 3rd edition, Cengage, 2012.