Profiles elsewhere:
Contact:
Email:
a.m.pauly@swansea.ac.uk
Postal address:
Dept of Computer Science
Swansea University
Bay Campus
Swansea SA1 8EN
United Kingdom
Office:
CoFo 409
Office hours
Arno Pauly
Lecturer in Computer Science
About me
Since October 2017, I am a lecturer at the Computer Science department of Swansea University. I am also an honorary research associate at the Computer Science Department of the University of Birmingham.Before that, I was a postdoctoral researcher in the verification group at ULB (Belgium) working with Jean-Francois Raskin, and a research fellow (the Denman Baynes student) at Clare College, Cambridge.
I received my PhD in 2012 from the University of Cambridge, where I was supervised by Anuj Dawar at the Computer Laboratory. For my undergrad, I studied Mathematics and Computer Science at the FernUniversitaet Hagen, Germany.
Research interests
My research interest include computability theory, computable analysis, descriptive set theory and (algorithmic) game theory. A theme I am very enthusiastic about is the role of algorithmic reasoning in the foundations of mathematics (and beyond).I am one of the main contributors to the development of the theory of Weihrauch reducibility. Weihrauch reducibility is a framework to compare the computational content of mathematical theorems (mainly from analysis). We can use this to explore how far away from being computable certain theorems are. A bibliography on Weihrauch reducibility maintained by Vasco Brattka is found here. Vasco Brattka, Guido Gherardi and I have written a survey on the area. A very short introduction is found here.
Project and postgraduate supervision
If you are a current student at SU and interested in doing a third-year or MSc project related to my research interests, please get in touch.I also welcome interest in doing either a PhD or an MSc by Research in Theoretical Computer Science (link) under my supervision. While I currently do not have funding for postgraduate students available, we can discuss potential funding opportunities.