Computability Learning Seminar

Jonny Stephenson, Pure Mathematics, University of Waterloo

"Jumps of relations"

We will show that the Kleene relation introduced last week is r.i.c.e complete, and use it to define a jump operator on relations in structures. We will check that the jump behaves as expected: if Q' is the jump of a relation Q, then Q is r.i. computable in Q', but Q' is not r.i. computable in Q.