Computability Learning Seminar

Mohammad Mahmoud, Department of Pure Mathematics, University of Waterloo

"Faizrahmanov-Kalimullin Theorem"

This week we finish the proof of Faizrahmanov-Kalimullin Theorem which says that there is a structure whose degree spectra is all the non-computable degrees, but unlike the Slaman-Wehner structure, there is no uniform computable way that gives us a copy of the structure from any non-computable set.

MC 5403