Computability Learning Seminar

Wednesday, June 15, 2016 10:00 am - 10:00 am EDT (GMT -04:00)

Jonathan Stephenson, Department of Pure Mathematics, University of Waterloo

“The Decanter Method (III)”

Last week we saw how to prove that a K-trivial real cannot be Turing complete, but we made several simplifying assumptions that set constants equal to zero.

This week, we will show how to modify the construction we used to make it work when the constants are allowed to take on arbitrary values.

MC 5403