Computability and Reducibility

6 - 11 August 2017 in Kloster (Hiddensee)

Sunday, August 6, 2017

     8.00 pm

          Welcome meeting


Monday, August 7, 2017

     9.30 am

          Karen Seidel: Language learning from a computational viewpoint  (Abstract, Slides)

     10.30 am

          Ulrich Berger: Concurrent program extraction in computable analysis  (Abstract)

     2.30 pm

         Arno Pauly : Welcher Weihrauch-Grad entspricht ATR_0?  (Abstract)

     7.30 pm

          Meeting in the restaurant „Buhne XI“

Tuesday, August 8, 2017

     9.30 am

          Guido Gherardi: Projection operators in computable analysis  (Abstract, Slides)

     10.30 am

          Vasco Brattka: Ein Limit-Kontrollsatz mit Anwendungen  (Abstract, Slides)

     2.30 pm

          Philipp Schlicht: Unendliche Turingmaschinen und erkennbare Mengen  (Abstract, Slides)

     3.30 pm

          Christine Gaßner: Effective descriptions of mathematical objects and the BSS–RAM model  (Abstract, Slides)


Wednesday, August 9, 2017

      9.30 am

          Matthias Schröder: Hybrid representations as a tool for Complexity Theory  (Abstract, Slides)

     10.30 am

          Robert Rettinger: On the definition of computational complexity in analysis  (Abstract)

      2.30 pm

          Florian Steinberg: Complexity in analysis and parameters  (Abstract)


 Thursday, August 10, 2017

      9.30 am

          Xizhong Zheng: On the computability and reducibility of approximable real numbers  (Abstract, Slides)

     10.30 am

          Rupert Hölzl: Rank and randomness  (Abstract, Slides)

     2.30 pm

          Discussions: New projects and open problems

Friday, August 11, 2017

     10.00 am

          Closing discussion