Computability Learning Seminar

Wednesday, March 16, 2016 3:30 pm - 3:30 pm EDT

Mohammad Mahmoud, Department of Pure Mathematics, University of Waterloo

“Number of K-creative sets”

Last time we have seen an upper bound on the number of K-trivial sets via some constant b. This week we compute a lower bound which as we will see is also a ”tight” bound (close to the exact number).

MC 5403