Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392)
Vasco Brattka, Akitoshi Kawamura, Alberto Marcone, Arno Pauly · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2016
This report documents the program and the outcomes of Dagstuhl Seminar 15392 "Measuring the Complexity of Computational Content: Weihrauch Reducibility and Reverse Analysis." It includes abstracts on most talks presented during the seminar, a list of open problems that were discussed and partially solved during the meeting as well as a bibliography on the seminar topic that we compiled during the seminar.