Computability Learning Seminar | Joey Lakerdas-Gayle | Dominant functions and high sets

Joey Lakerdas-Gayle, University of Waterloo

Dominant functions and high sets

We prove Martin's theorem that \(A'\geq_T\emptyset''\) if and only if $A$ computes a function that bounds every total computable function almost everywhere. Then we will begin discussing the infinite injury priority tree construction of Sacks' theorem that there exists a high incomplete c.e. set.

MC 5403