Talk: Survey of mathematically applied computability theory

Despite being relatively small, my department has three faculty in finite combinatorics, in addition to having me in logic. I recently gave a series of two talks in our seminar to present a broad overview of classical computability theory, and to present some more recent applications to mathematics, via Reverse Mathematics and via Weihrauch Reducibility.

These talks were intended for a very non-expert audience, and they may be of interest to others.

This entry was posted in Talks. Bookmark the permalink.

Leave a Reply

Your email address will not be published. Required fields are marked *