Версия 12:08, 10 октября 2024

Содержание

Lectures: Thursday 14h00 -- 15h20, Smolenskaya and online

Invite link for telegram group for announcements and discussions (will be soon)

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.

Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam]

Bruno Bauwens: Tuesday 12h -- 20h. Wednesday 16h -- 18h. Friday 11h -- 17h. Better send me an email in advance.

@@ Строка 18: / Строка 18: @@
   || 17.10 || Optimality of Solomonoff induction for reinforcement learning. ||
 |}
@@ Строка 24: / Строка 23: @@
   Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam] <br>
-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.