Verónica Becher

Computability, complexity and randomness (dagstuhl seminar 12021)

2012, Dagstuhl Reports 2 (1), 2012
Citas: 4
Agregar PDF Importar citas Importar citas SCRAPME Plots Conexiones

Autor(es)

Verónica Becher and Laurent Bienvenu and Rodney Downey and Elvira Mayordomo

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.

Plot de citas