Theoretical computer science spring 2023 — различия между версиями
Bbauwens (обсуждение | вклад) |
Bbauwens (обсуждение | вклад) |
||
| Строка 29: | Строка 29: | ||
|| 16.03 || Recursion and induction. (Chapt 3 of discrete math book.) Turing machines. || || [https://www.dropbox.com/s/ee0kaxd8wrr5k7b/4_HW.pdf?dl=0 hw4] | || 16.03 || Recursion and induction. (Chapt 3 of discrete math book.) Turing machines. || || [https://www.dropbox.com/s/ee0kaxd8wrr5k7b/4_HW.pdf?dl=0 hw4] | ||
|- | |- | ||
| − | || 23.03 || Invariants (Chapt 5). Undecidability || [https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] || [https://www.dropbox.com/s/17ogtcftqh7ybzo/5_HW.pdf?dl=0 hw5] | + | || 23.03 || Invariants (Chapt 5). Undecidability || [https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] || [https://www.dropbox.com/s/17ogtcftqh7ybzo/5_HW.pdf?dl=0 hw5] |
|- | |- | ||
|| 29.03 || Completeness || [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] || | || 29.03 || Completeness || [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] || | ||
Версия 18:52, 24 марта 2023
Содержание
[убрать]Classes
Wednesdays 18:10–21:00, in room S834.
Teacher: Bruno Bauwens
Homeworks need to be emailed to brbauwens -at- gmail.com before the start of the lecture next lecture. Put tcs in the subject line.
For practical information ask to join the telegram group.
Course Materials
| Video | Summary | Notes | Homework |
|---|---|---|---|
| 08.02 | Regular languages 1: deterministic automata, pumping lemma, closure properties | lecture 1 & 2 | hw1 |
| 15.02 | Regular languages 2: nondeterministic automata and regular expressions | hw2 | |
| 01.03 | Chapter 1 of discrete math for computer science (see 1st book below). Turing machines | Turing machines | hw3 |
| 16.03 | Recursion and induction. (Chapt 3 of discrete math book.) Turing machines. | hw4 | |
| 23.03 | Invariants (Chapt 5). Undecidability | lecture 3.A | hw5 |
| 29.03 | Completeness | 3.B | |
| 12.04 | The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. NP-completeness, | notes | |
| 19.04 | circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) | circuits | |
| 26.04 | Reductions. The classes RP, coRP and BPP, primes in BPP | reductions | |
| Exam |
Grading
Homework: 35%
Theory exam: 35%
Problem solving exam: 30%
Passing threshold is 4/10. Grades above 5/10 are rounded up, the other grades are rounded down.
References
Basic math
Golovnev, Kulikov, Podolskii, Shen, Discrete mathematics for computer science, 2020.
Lecture notes: Discrete Mathematics, L. Lovasz, K. Vesztergombi
Лекции по дискретной математике (черновик учебника, in Russian)
Computational complexity
Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)
Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)
Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)
Mathematical writing
Sosinsky, Как написать математическую статью по-английски, 2000.
Knuth, Technical writing, transcripts of lectures, 1987.
Gillman, Writing Mathematics Well, 1987.
Office hours
| Person | Monday | Tuesday | Wednesday | Thursday | Friday |
|---|---|---|---|---|---|
| Bruno Bauwens, S834, Zoom | 14:00-18:00 |
Warn me in advance by email.
