1 Search Results for "Becher, Veronica"


Document
Computability, Complexity and Randomness (Dagstuhl Seminar 12021)

Authors: Veronica Becher, Laurent Bienvenu, Rodney Downey, and Elvira Mayordomo

Published in: Dagstuhl Reports, Volume 2, Issue 1 (2012)


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

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)


Copy BibTex To Clipboard

@Article{becher_et_al:DagRep.2.1.19,
  author =	{Becher, Veronica and Bienvenu, Laurent and Downey, Rodney and Mayordomo, Elvira},
  title =	{{Computability, Complexity and Randomness (Dagstuhl Seminar 12021)}},
  pages =	{19--38},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{2},
  number =	{1},
  editor =	{Becher, Veronica and Bienvenu, Laurent and Downey, Rodney and Mayordomo, Elvira},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.1.19},
  URN =		{urn:nbn:de:0030-drops-34555},
  doi =		{10.4230/DagRep.2.1.19},
  annote =	{Keywords: algorithmic randomness, computability theory, computationl complexity, Kolmogorov complexity, algorithmic information theory}
}
  • Refine by Author
  • 1 Becher, Veronica
  • 1 Bienvenu, Laurent
  • 1 Downey, Rodney
  • 1 Mayordomo, Elvira

  • Refine by Classification

  • Refine by Keyword
  • 1 Kolmogorov complexity
  • 1 algorithmic information theory
  • 1 algorithmic randomness
  • 1 computability theory
  • 1 computationl complexity

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2012

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