“Structural and binary information”

Jonathan Stephenson, Department of Pure Mathematics, University of Waterloo

We will first complete our proof that Q is strictly below Q’ in rT degree, and then introduce definitions to distinguish between relations which are purely structural, and those which code some additional noncomputable information. A relation is structurally complete if it can be joined with a relation coding a subset of the natural numbers to create a complete relation. If time permits, we will discuss one or more examples of structurally complete relations in greater detail.

MC 5417