Kolmogorov complexity 24/25 — различия между версиями
Bauwens (обсуждение | вклад) |
Bauwens (обсуждение | вклад) |
||
| Строка 16: | Строка 16: | ||
|| [https://www.youtube.com/watch?v=0m7RXtisu5w 04.10] || Course overview, (universal) Turing machines, computable and non-computable sets and functions. [https://www.dropbox.com/scl/fi/0fxjeu8h1ekawcueto4yn/01slides.pdf?rlkey=ww3ec2ngtoysexwoc6wahcfg4&st=7t55t5bi&dl=0 slides] || [https://www.dropbox.com/scl/fi/n1vhfvtfagv2ji6x30exn/00notes.pdf?rlkey=pvd79gi91567mut35n87j1vfo&st=ypsaw36s&dl=0 ch00] [https://www.dropbox.com/scl/fi/cm2xfnegccktu3s7h00wy/01notes.pdf?rlkey=87ctjsio681ee821tzlomufqp&st=jvdlwdnn&dl=0 ch01]|| [https://www.dropbox.com/scl/fi/2alcydgfglcxs8rst99kk/01sem.pdf?rlkey=pe1xwmex19wi32bppr5s4bmdz&st=mzww1qix&dl=0 sem01] ''update 11.10''|| | || [https://www.youtube.com/watch?v=0m7RXtisu5w 04.10] || Course overview, (universal) Turing machines, computable and non-computable sets and functions. [https://www.dropbox.com/scl/fi/0fxjeu8h1ekawcueto4yn/01slides.pdf?rlkey=ww3ec2ngtoysexwoc6wahcfg4&st=7t55t5bi&dl=0 slides] || [https://www.dropbox.com/scl/fi/n1vhfvtfagv2ji6x30exn/00notes.pdf?rlkey=pvd79gi91567mut35n87j1vfo&st=ypsaw36s&dl=0 ch00] [https://www.dropbox.com/scl/fi/cm2xfnegccktu3s7h00wy/01notes.pdf?rlkey=87ctjsio681ee821tzlomufqp&st=jvdlwdnn&dl=0 ch01]|| [https://www.dropbox.com/scl/fi/2alcydgfglcxs8rst99kk/01sem.pdf?rlkey=pe1xwmex19wi32bppr5s4bmdz&st=mzww1qix&dl=0 sem01] ''update 11.10''|| | ||
|- | |- | ||
| − | || [https://www.youtube.com/watch?v=p6vKnnPfVOM 11.10] || Optimality of Solomonoff induction. || || [https://www.dropbox.com/scl/fi/otz8g8vjhovpllkkahrts/02sem.pdf?rlkey=o36rg87pbjh2jkywngtt3yctn&st=75is03yf&dl=0 sem02] ''update 14.10''|| | + | || [https://www.youtube.com/watch?v=p6vKnnPfVOM 11.10] || Optimality of Solomonoff induction. || || [https://www.dropbox.com/scl/fi/otz8g8vjhovpllkkahrts/02sem.pdf?rlkey=o36rg87pbjh2jkywngtt3yctn&st=75is03yf&dl=0 sem02] ''update 14.10'' (Huawei [https://www.dropbox.com/scl/fi/nwp13nmrzyji1cqt4uds5/02hsem.pdf?rlkey=f8cys0wr4n8hqho22pd9lvcoi&st=bmzxl4l5&dl=0 sem02])|| |
|} | |} | ||
Версия 15:31, 17 октября 2024
Содержание
Classes
Lectures + seminar: Friday 18h10 -- 21h00 in Pokrovkaya room G405 (electives-shedule) and in zoom. The teacher is Bruno Bauwens.
Telegram group for announcements and discussions invite link.
Course Materials
| Rec | Summary | Notes | Problem list | Solutions |
|---|---|---|---|---|
| 04.10 | Course overview, (universal) Turing machines, computable and non-computable sets and functions. slides | ch00 ch01 | sem01 update 11.10 | |
| 11.10 | Optimality of Solomonoff induction. | sem02 update 14.10 (Huawei sem02) |
Homeworks
Deadlines: every 2 weeks, before the lecture at 18h00. Submit in pdf or fotos of handwritten to brbauwens@gmail.com with the subject line starting with KOLM-HW. Link with results will be here.
Tasks are in the problem lists from the seminar. Deadlines: problem lists 1 and 2: at the start of 3rd lecture, lists 3 and 4 at the start of the 5th lecture, etc.
Late policy: 1 homework can be submitted at most 24h late without explanations.
References
Todo
Grading
Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam]
Some homework assignments contain extra problems. Each solution of an extra problem will give 1 extra points on the final exam (which is graded out of 10). There will be around 10 extra problems. Rounding is applied only when the final score is transferred to the official grade. Arithmetic rounding is used. Autogrades. If only 6/10 for the exam is needed to get a final score of 10/10, then this will be given automatically.
Colloquium and exam
Colloquium: in the middel of December, a list with about 10 questions will be provided.
Exam: Problems similar to the homework. You may use main references, lecture notes, and handwritten notes.
Office hours
Bruno Bauwens: Tuesday 12h -- 20h. Wednesday 16h -- 18h. Friday 11h -- 17h. Better send me an email in advance.
