Theory of Computing 2019 2020 — различия между версиями
Материал из Wiki - Факультет компьютерных наук
| Строка 10: | Строка 10: | ||
== Course Materials == | == Course Materials == | ||
| + | |||
| + | In the first several lecture we follow Sipser's book "Introduction to the theory of computation" | ||
{| class="wikitable" | {| class="wikitable" | ||
Версия 12:22, 7 сентября 2019
General Information
Classes: Fridays, 15:10-18:00, R406
Dates and Deadlines
Homework 1, deadline: 4 October, before the lecture
Course Materials
In the first several lecture we follow Sipser's book "Introduction to the theory of computation"
| Date | Summary | Problem list |
|---|---|---|
| 06.09 | Turing machines, multitape Turing machines, connection between them. Examples. Time and space complexity. Complexity classes P, PSPACE, EXP. | Problem list 1 |
Office hours
| Person | Monday | Tuesday | Wednesday | Thursday | Friday |
|---|---|---|---|---|---|
| Vladimir Podolskii, room S830 | |||||
| Bruno Bauwens, room S834 |
