Computability Learning Seminar

Wednesday, March 9, 2016 3:30 pm - 3:30 pm EST (GMT -05:00)

Mohammad Mahmoud, Department of Pure Mathematics, University of Waterloo

“K-trivial Sets”

This week we discuss the main notion of chapter 5, K-triviality. We prove some results about K-trivial sets like, for example, they are ∆02, and that each set that is low for K is K-trivial. Also the class of K-trivial sets turns out to be closed under the join operator . The importance of this class appears more in section 5.4 where there is proved that it coincides with the class of sets low for K (for ML-randomness).

MC 5403