Computability Learning Seminar | Joey Lakerdas-Gayle | High incomplete c.e. set

Thursday, July 30, 2026 1:30 pm - 3:00 pm EDT (GMT -04:00)

Joey Lakerdas-Gayle, University of Waterloo

High incomplete c.e. set

We use an infinite injury priority tree construction to prove Sacks' theorem that there exists a high incomplete c.e. set.

MC 5403