Computability Learning Seminar

Michael Deveau, Department of Pure Mathematics, University of Waterloo

“The Golden Run Construction - Part 5”

At long last, we will show that the K-trivial set A we have been considering is low for K. To do this, we will expand on the brief teaser presented last time and show how a golden run may be augmented to build a request set W that witnesses that A is low for K. Of course, we have one final speed bump to take care of first: we must show that W is a bounded request set.

MC 5403