Syllabus
Concepts ?low for random", ?K-trivial".
Computationally weak sets from the point of view of algorithmic randomness and their equivalence.
Basic properties of K-trivial sets.
Applications to recursion theory.
Modifications and generalizations of K-trivial sets.
Annotation
Algorithmic randomness, for PhD students.
Calibrating randomness. K-trivials, low for random.
Applications to recursion theory.