Computability, Complexity and Randomness is a series of conferences devoted generally to the mathematics
of computation and complexity, but tends to primarily focus on algorithmic randomness/algorithmic information
theory and its impact on mathematics. Algorithmic randomness is the part of mathematics devoted to ascribing
meaning to the randomness of individual strings and infinite sequences. For example, we give mathematical
meaning to the intuition that one would more readily believe that the string 01101101001101011 was produced
via the flips of a fair coin than one would of the string 00000000000000000. The core idea is that a sequence
is algorithmically random if it passes all computational randomness tests, and hence if a computational observer
cannot distinguish its behaviour in some process from the expected behaviour.
There are several historical approaches to algorithmic randomness, such as computable martingales, Kolmogorov complexity
and Martin-Loff of randomness. Algorithmic randomness is also related to classical concepts, such as entropy
(in the senses of Shannon and Boltzmann).
The mathematics of this area is really quite deep. The kinds of questions include:
How do we calibrate levels of randomness? Can we amplify weak random sources?
Is randomness a provable computational resource? What kinds of power do random sources give us?
And so on. Tools from this area can be used in many areas of mathematics and computer science,
including the expected behaviour of algorithms, computational biology, ergodic theory, geometric measure theory,
number theory and normality. The theme of the conference is algorithmic randomness and related topics in computability,
complexity and logic, such as Kolmogorov complexity, computational complexity and reverse mathematics.
Topics
Algorithmic randomness
Computability theory
Kolmogorov complexity
Computational complexity
Reverse mathematics and logic
Scientific Programme Committee
Verónica Becher (Buenos Aires, Argentina)
Jack Lutz (Ames, USA)
Alexander G. Melnikov (Wellington, New Zealand)
Wolfgang Merkle, co-chair (Heidelberg, Germany)
Kenshi Miyabe (Kawasaki-city, Japan)
Mariya I. Soskova (Madison, USA)
Linda Brown Westrick, co-chair (State College, USA)
Kochel am See is beautifully located at Lake Kochel at the edge of the Bavarian Alps, approximately
70 km south of Munich, from where it can easily be reached by train (see below).
Accommodation for most participants of the conference will be available at the Georg-von-Vollmar Academy
for a reasonable daily rate. The available rooms will be assigned on a first-come-first-served basis
during the registration procedure. See some panorama pictures
of the Georg-von-Vollmar Academy.
Travelling
For your trip to Kochel there are several options:
Either take a taxi from Kochel train station to the Georg-von-Vollmar Academy (approximately 5 minutes, you might have to order it in advance:
Phone +49 8851 1315).
Or walk from Kochel train station to the Academy (approximately 17 minutes). However, you need to walk slightly up the hill (50 meters). See map below.
Your stop-over on a train trip to Kochel could be Munich central station or the station Munich-Pasing.
CCR Steering Committee
Verónica Becher (Buenos Aires, Argentina),
Laurent Bienvenu (Montpellier, France),
Rod Downey, chair (Wellington, New Zealand),
Denis Hirschfeldt (Chicago, United States),
Elvira Mayordomo (Zaragoza, Spain),
Wolfgang Merkle (Heidelberg, Germany),
Nikolai K. Vereshchagin (Moscow, Russia),
Liang Yu (Nanjing, China).
Previous CCR Conferences
CCR 2022, 15th International Conference on Computability, Complexity and Randomness, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK, 6-10 June 2022
CCR 2019, 14th International Conference on Computability, Complexity and Randomness, Astana, Kazakhstan, 23-25 June 2019
CCR 2018, 13th International Conference on Computability, Complexity and Randomness, Santiago de Chile, Chile, 17-21 December 2018
CCR 2017, 12th International Conference on Computability, Complexity and Randomness, Mysore, India, 3-7 July 2017
CCR 2016, 11th International Conference on Computability, Complexity and Randomness, Honolulu, Hawaii, USA, 4-8 January 2016
CCR 2015, 10th International Conference on Computability, Complexity and Randomness, Heidelberg, Germany, 22-26 June 2015
CCR 2014, 9th International Conference on Computability, Complexity and Randomness, Singapore, 9-13 June 2014
CCR 2013, 8th International Conference on Computability, Complexity and Randomness, Moscow, Russia, 23-27 September 2013
CCR 2012, 7th International Conference on Computability, Complexity and Randomness, Cambridge, UK, 2-6 July 2012
CCR 2011, 6th International Conference on Computability, Complexity and Randomness, Cape Town, South Africa,January 31-February 4, 2011
CCR 2010, 5th International Conference on Computability, Complexity and Randomness, Notre Dame, USA, 2010
CCR 2009, 4th International Conference on Computability, Complexity and Randomness, Luminy, France, 2009
CCR 2008, 3th International Conference on Computability, Complexity and Randomness, Nanjing, China, 2008
CCR 2007, 2th International Conference on Computability, Complexity and Randomness, Buenos Aires, Argentina, 2007
CCR 2004, 1th International Conference on Computability, Complexity and Randomness, Córdoba, Argentina, 2004
Further Information
For further information, please contact
Wolfgang Merkle, as co-chair of the Programme Committee,
(for the scientific program)
Linda Westrick, as co-chair of the Programme Committee,
(for the scientific program)
Rupert Hölzl, for the Organizing Committee,
(for local information)