Pieter Collins visiting

Pieter Collins is currently visiting us from Maastricht. Today he will give a talk on "Verified Verification: Formal Proofs of Rigorous Numerical Methods for Model-Checking Dynamic Systems" as a part of our Theory Seminar series. 

Tonicha Crook passed her PhD viva

Congratulations to Tonicha Crook passed her PhD viva today. The examiners were Pieter Collins (Maastricht) and Faron Moller (Swansea). The title of her PhD thesis is:  Computable Analysis and Game Theory: From Foundations to Applications. The PhD was supervised by Arno Pauly. 

Dagstuhl meeting "Weihrauch Complexity: Structuring the Realm of Non-Computability"

Arno Pauly is organising the Dagstuhl meeting "Weihrauch Complexity: Structuring the Realm of Non-Computability" with Vasco Brattka, Alberto Marcone and Linda Westrick. More information to follow. 

Upcoming invited talks from our group members

Monika Seisenberger has been invited to give a talk at a joint event of the BCTCS 2024 and Southern Logic Seminar in Bath in April 2024. More information about BCTCS 2024 can be found here.

Arno Pauly will give an invited talk at the Leeds Computability Days in July.

Manlio Valenti will give an invited talk at the AMS-UMI International joint meeting (Palermo, July) and at the joint meeting of the New Zealand, Australian and American mathematical societies (Auckland, December).

 

New Publications

Manlio Valenti, together with his collaborators David Reed Solomon and Damir Dzhafarov, submitted the paper “The tree pigeonhole principle in the Weihrauch degrees”: https://meetings.ams.org/math/jmm2024/meetingapp.cgi/Paper/29664

Happy New Year!

 

David Trotta visiting Swansea

We are thrilled to extend a warm welcome to Davide Trotta, a postdoctoral researcher at the Department of Computer Science at the University of Pisa in Italy. Davide brings his knowledge and expertise to our community, and we are excited to have him as a guest speaker in our upcoming seminar series, which will take place on Monday, 4 December in our Theory Lab.

 Title: Categorifying computable reducibilities

Abstract: One of the most relevant notions of categorical logic which enabled the study of logic from a purely algebraic perspective is the notion of a (hyper)doctrine, introduced in a series of seminal papers by F.W. Lawvere to synthesize the structural properties of logical systems. In this talk, I will introduce this categorical approach to logic and explain how various notions well-known in computability can be framed within this categorical framework.

In particular, I will present categorical formulations in terms of Lawvere doctrines for the Medvedev, Muchnik, and Weihrauch reducibilities.

Finally, I will discuss some universal properties of such doctrines, showing how this study enables us to identify, from an abstract perspective, the common features of these notions of reducibility.

This talk is based on joint work with Manlio Valenti and Valeria de Paiva.