Huawei-Kolmogorov-complexity-fall-2024
Материал из Wiki - Факультет компьютерных наук
Версия от 12:08, 10 октября 2024; Bauwens (обсуждение | вклад)
Содержание
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 | ||
| 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.
