Theory of Computing 2019 2020
Материал из Wiki - Факультет компьютерных наук
Версия от 12:33, 7 сентября 2019; Vpodolskii (обсуждение | вклад)
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"
If you need some background in math, consider these two sourses:
Lecure notes: Discrete Mathematics, L. Lovasz, K. Vesztergombi
Лекции по дискретной математике (черновик учебника, in Russian)
| 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 Updated: 07.09.19 |
Office hours
| Person | Monday | Tuesday | Wednesday | Thursday | Friday |
|---|---|---|---|---|---|
| Vladimir Podolskii, room S830 | |||||
| Bruno Bauwens, room S834 |
