Computability Learning Seminar

Michael Deveau, Department of Pure Mathematics, University of Waterloo

“The Golden Run Construction - Part 2”

Now that we have gained some conceptual understanding of the construction and have explored the new difficulty of showing that our set is low for K compared to the earlier con- structions, we now turn to describing the procedures P and Q that were identified last time. Formally describing their actions and verifying that they behave correctly and respect their goal and garbage quotas will take some time, and this will be our focus for the immediate future.

M3-3013

**Please note room**