Theory of Computing 2019 2020 — различия между версиями

Материал из Wiki - Факультет компьютерных наук
Перейти к: навигация, поиск
Строка 12: Строка 12:
  
 
In the first several lecture we follow Sipser's book "Introduction to the theory of computation"
 
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:<br>
 +
[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecure notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi<br>
 +
[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)
 +
  
 
{| class="wikitable"
 
{| class="wikitable"

Версия 12:29, 7 сентября 2019

General Information

Classes: Fridays, 15:10-18:00, R406

Grading

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

Office hours

Person Monday Tuesday Wednesday Thursday Friday
Vladimir Podolskii, room S830
Bruno Bauwens, room S834