University Seminar: Computability, Complexity, and Algebraic Structure
Wednesday, April 8, 2026
5:00 pm - 6:00 pm
Time: Wednesday, April 8, 5:00–6:00 pm
Place: Phillips Hall, Room 108
Speaker: Jeremias Valenzuela Morales
Title: Some examples of computably enumerable permitting
Abstract: Permitting is a technique often used in types of priority arguments where we construct a computably enumerable set D in such a way that their strategies need to get permission, in the form of an enumeration into D, for requirements to be able to act. In this talk we will explore the details of two permitting techniques and consider the viability of different indexing frameworks for this type of priority arguments.