Academia.eduAcademia.edu
paper cover icon
Computability, Complexity and Randomness (Dagstuhl Seminar 12021)

Computability, Complexity and Randomness (Dagstuhl Seminar 12021)

Dagstuhl Reports, 2012
Verónica Becher
Abstract
Research on the notions of information and randomness has drawn on methods and ideas from computability theory and cumputational complexity, as well as core mathematical subjects like measure theory and information theory. The Dagstuhl seminar 12021 ``Computability, Complexity and Randomness'' was aimed to meet people and ideas in these areas to share new results and discuss open problems. This report collects the material presented during the course of the seminar.

Verónica Becher hasn't uploaded this paper.

Let Verónica know you want this paper to be uploaded.

Ask for this paper to be uploaded.