Dagstuhl Seminar 25131
Weihrauch Complexity: Structuring the Realm of Non-Computability
( Mar 23 – Mar 28, 2025 )
Permalink
Please use the following short url to reference this page:
https://www.dagstuhl.de/25131
Organizers
- Vasco Brattka (Bundeswehr University Munich, DE)
- Alberto Marcone (University of Udine, IT)
- Arno Pauly (Swansea University, GB)
- Linda Westrick (Pennsylvania State University - University Park, US)
Contact
- Michael Gerke (for scientific matters)
- Susanne Bach-Bernhard (for administrative matters)
Related Seminars
- Dagstuhl Seminar 15392: Measuring the Complexity of Computational Content: Weihrauch Reducibility and Reverse Analysis (2015-09-20 - 2015-09-25) (Details)
- Dagstuhl Seminar 18361: Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (2018-09-02 - 2018-09-07) (Details)
Classification
- Logic in Computer Science
Keywords
- Computability and complexity
- combinatorial problems
- reverse and constructive mathematics
- computable analysis
- Weihrauch reducibility and related reducibilities