Carrie Knoll, Department of Pure Mathematics University of Waterloo
“Computability”
In this talk we will answer the question: ”What is computability theory?”. After a brief look at the historical problem of how to formalize the notion of a ’computation’, we will explore some of the main concepts and tools of modern computability theory. This part of the talk will likely feature things like ”Turing machines” and ”halting problems”. Once we have developed this language, we will see an introduction to the area of computable structure theory which involves applying computability- theoretic ideas to classical structures and results.