Computability Learning Seminar

Michael Deveau, Department of Pure Mathematics, University of Waterloo

“The Golden Run Construction - Part 3”

After our short interlude into K-degrees, we return to the details of the golden run construc- tion. We will focus our attention on verifying that the procedures P and Q defined formally last time operate as they should and ultimately respect their garbage quotas. This will allow us to use the Recursion Theorem to find a set of procedures that contain a golden run, and ultimately show that A is low for K.

MC 5403

**Please Note Time**