Document Open Access Logo

Computability, Complexity and Randomness (Dagstuhl Seminar 12021)

Authors Veronica Becher, Laurent Bienvenu, Rodney Downey, Elvira Mayordomo and all authors of the abstracts in this report

PDF

File

Thumbnail PDF
PDF
DagRep.2.1.19.pdf
  • Filesize: 0.76 MB
  • 20 pages

Document Identifiers

Subject Classification

Keywords
  • algorithmic randomness
  • computability theory
  • computationl complexity
  • Kolmogorov complexity
  • algorithmic information theory

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

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.

Cite As Get BibTex

Veronica Becher, Laurent Bienvenu, Rodney Downey, and Elvira Mayordomo. Computability, Complexity and Randomness (Dagstuhl Seminar 12021). In Dagstuhl Reports, Volume 2, Issue 1, pp. 19-38, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012) https://doi.org/10.4230/DagRep.2.1.19

Author Details

Veronica Becher
Laurent Bienvenu
Rodney Downey
Elvira Mayordomo
and all authors of the abstracts in this report
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact