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