| No. |
Title |
Author |
Year |
| 1 |
Computability and Complexity in Analysis (Dagstuhl Seminar 01461) |
Brattka, Vasco et al. |
2021 |
| 2 |
Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361) |
Brattka, Vasco et al. |
2019 |
| 3 |
Computability Theory (Dagstuhl Seminar 17081) |
Ambos-Spies, Klaus et al. |
2017 |
| 4 |
Monte Carlo Computability |
Brattka, Vasco et al. |
2017 |
| 5 |
Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392) |
Brattka, Vasco et al. |
2016 |
| 6 |
Las Vegas Computability and Algorithmic Randomness |
Brattka, Vasco et al. |
2015 |
| 7 |
Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411) |
Berger, Ulrich et al. |
2012 |
| 8 |
Effective Choice and Boundedness Principles in Computable Analysis |
Brattka, Vasco et al. |
2009 |
| 9 |
Weihrauch Degrees, Omniscience Principles and Weak Computability |
Brattka, Vasco et al. |
2009 |
