Huawei-Kolmogorov-complexity-fall-2024 — различия между версиями
Материал из Wiki - Факультет компьютерных наук
Bauwens (обсуждение | вклад) |
Bauwens (обсуждение | вклад) |
||
| Строка 14: | Строка 14: | ||
! Rec !! Summary !! Notes !! Problem list !! Solutions | ! Rec !! Summary !! Notes !! Problem list !! Solutions | ||
|- | |- | ||
| − | || 10.10 || Course overview, (universal) Turing machines, computable and non-computable sets and functions. [https://www.dropbox.com/scl/fi/ | + | || 10.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]|| |
|- | |- | ||
| − | || 17.10 || Optimality of Solomonoff induction for reinforcement learning. || | + | || 17.10 || Optimality of Solomonoff induction for reinforcement learning. || || |
|} | |} | ||
Текущая версия на 00:24, 11 октября 2024
Содержание
Classes
Lectures: Thursday 14h00 -- 15h20, Smolenskaya and online
Invite link for telegram group for announcements and discussions (will be soon)
Course Materials
| Rec | Summary | Notes | Problem list | Solutions |
|---|---|---|---|---|
| 10.10 | Course overview, (universal) Turing machines, computable and non-computable sets and functions. slides | ch00 ch01 | sem01 | |
| 17.10 | Optimality of Solomonoff induction for reinforcement learning. |
Grading
Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam]
Office hours
Bruno Bauwens: Tuesday 12h -- 20h. Wednesday 16h -- 18h. Friday 11h -- 17h. Better send me an email in advance.
