Computability and Randomness

Computability and Randomness

Instructor:
Yijia Chen

Time:
6:30pm - 8:00pm every Monday

References:

[Aar] Why Philosophers Should Care About Computational Complexity
by S.Aaronson, 2013.
[Clay] P vs NP Problem
by Clay Mathematics Institute, 2000.
[CFM13] Consistency, optimality, and incompleteness
by Y. Chen, J. Flum, and M. Müller, 2013.

Slides:

(1) 09/03/2015 [Aar, Clay]
(2) 16/03/2015[Clay]
(3) 23/03/2015[CFM]
(4) 30/03/2015[Clay]
(5) 13/04/2015[Aar]
(6) 20/04/2015[Aar]

Homework:

To view the ps and pdf files, you need GSview and Acrobat Reader.

Yijia Chen, last modified: 21. 04. 2015