Michael Deveau, Department of Pure Mathematics, University of Waterloo
“The Golden Run Construction - Part 4”
Now that we have verified that individual procedures respect their garbage quotas, we can use this information to show that the request set we have been working with is bounded. This will allow us to use the Recursion Theorem as promised. Following this, we will finally define the titular golden run, show that it exists, and begin to see how it helps us show that A is low for K.
MC 5403