Computability Theory Learning Seminar

Szymon Adamus, Department of Pure Mathematics, University of Waterloo

"Punctual Computability Theory - Part 2"

Punctual computability theory is a relatively new branch of computability theory that deals with punctual structures, a class of structures intermediate between polynomial-time and computable structures. In part 2 of this series of talks I will continue exploring the topic of universality with regards to punctual structures, this time proving that the class of relational structures is not punctually universal. I will also give a brief outline of the proofs of some of the results I stated last week when proving graphs are not punctually universal. 

MC 5403