Computability Learning Seminar

Michael Deveau, Department of Pure Mathematics, University of Waterloo

"Non-triviality of the Bounded Jump Hierarchy - Part 2"

We continue with the proof that for all $B$, there is some set $A$ with $B <_{bT} A <_{bT} B^b$. We start the main construction itself, check that the requirements eventually settle and are met, and we investigate the correct $\hat{h}_A$ and $\hat{h}_C$ as promised.

MC 5413