DagRep.5.9.77.pdf
- Filesize: 1.12 MB
- 28 pages
Document
Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 5, Issue 9
Volume: Dagstuhl Reports, Volume 5
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2016-01-19
Cite As Get BibTex
Vasco Brattka, Akitoshi Kawamura, Alberto Marcone, and Arno Pauly. Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392). In Dagstuhl Reports, Volume 5, Issue 9, pp. 77-104, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/DagRep.5.9.77
Abstract
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.
Subject Classification
Keywords
- Computability and complexity in analysis
- computations on real numbers
- reducibilities
- descriptive complexity
- computational complexity
- reverse and constructive mathematics
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads