Huawei-Kolmogorov-complexity-fall-2024 — различия между версиями
Материал из Wiki - Факультет компьютерных наук
Bauwens (обсуждение | вклад) |
Bauwens (обсуждение | вклад) |
||
(не показаны 2 промежуточные версии этого же участника) | |||
Строка 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/kea3f2888zrfmiu7kbuaw/01slides.pdf?rlkey=8wohccfrcwt5j5fvr0ltqxb2j&st=ndcob512&dl=0 slides] || [https://www.dropbox.com/scl/fi/0bbgs9q2tvs7462nov6ml/00notes.pdf?rlkey=59eg45qm420rmvgik8062fdra&st=cbvunx5z&dl=0 ch00] [https://www.dropbox.com/scl/fi/2ipwvmn6i4z5uoc5ehvsq/01notes.pdf?rlkey=ao740xt6abqir89nh9a90ls0j&st=4wqf1ssl&dl=0 ch01]|| | + | || 10.10 || Course overview, (universal) Turing machines, computable and non-computable sets and functions. [https://www.dropbox.com/scl/fi/kea3f2888zrfmiu7kbuaw/01slides.pdf?rlkey=8wohccfrcwt5j5fvr0ltqxb2j&st=ndcob512&dl=0 slides] || [https://www.dropbox.com/scl/fi/0bbgs9q2tvs7462nov6ml/00notes.pdf?rlkey=59eg45qm420rmvgik8062fdra&st=cbvunx5z&dl=0 ch00] [https://www.dropbox.com/scl/fi/2ipwvmn6i4z5uoc5ehvsq/01notes.pdf?rlkey=ao740xt6abqir89nh9a90ls0j&st=4wqf1ssl&dl=0 ch01]|| || |
+ | |- | ||
|| 17.10 || Optimality of Solomonoff induction for reinforcement learning. || | || 17.10 || Optimality of Solomonoff induction for reinforcement learning. || | ||
|} | |} | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
= Grading = | = Grading = | ||
Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam] <br> | Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam] <br> | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
Текущая версия на 12:08, 10 октября 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 | ||
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.