Computability Learning Seminar

Beining Mu, University of Waterloo

Sacks' Splitting Theorem

In this talk, I will present Sacks’ Splitting Theorem, which states that every nonzero computably enumerable degree can be split into the join of two strictly lower computably enumerable degrees, as an example of finite injury priority argument. I will discuss two different proofs of the theorem, one of which is the classical way of how people think about finite injury arguments, while the other is a modern way of presenting a priority argument where a priority tree is involved.

MC 5403