skip to content

International conference on computability, complexity and randomness


we have been made aware of a very convincing phone scam that is focusing on our workshop participants. Participants may be contacted by phone by a firm called Business Travel Management to arrange accommodation for workshops and/or programmes.  This includes a request to enter credit card information.

Please note, INI will never contact you over the phone requesting card details. We take all payments via the University of Cambridge Online store

If you have been contacted by this company please contact us as soon as possible.

6th June 2022 to 10th June 2022
Elvira Mayordomo
Rod Downey
Paul Shafer

Workshop theme:

In 2012, the Newton Institute hosted a high-profile programme Syntax and Semantics: A Legacy of Alan Turing, which was a major component of the worldwide Alan Turing Year celebrations. The capstone workshop of the Syntax and Semantics programme was the 7th Conference on computability, Complexity and Randomness. This follow-up workshop serves as the 15th Conference on Computability, Complexity and Randomness.

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.

Deadline for applications: 5th April 2021

Please note members of Cambridge University are welcome to turn up and sign in as a non-registered attendee on the day(s) during the workshop and attend the lecture(s). Please note that we cannot provide you with any support including name badge, meals or accommodation.

In addition to visiting the INI, there are multiple ways in which you can participate remotely.

Apply now


Registration Only    
  • Registration Package: £TBC
  • Student Registration Package: £TBC

The Registration Package includes admission to all seminars, lunches and refreshments on the days that lectures take place (Monday - Friday), wine reception and formal dinner, but does not include other meals or accommodation.

Registration and Accommodation
  • Accommodation Package: £TBC

The Accommodation Package includes a registration fee, bed and breakfast accommodation at TBC, from the evening of Sunday to breakfast on Saturday, together with lunches and refreshments during the days that lectures take place (Monday - Friday). The formal dinner is also included, but no other evening meals.

Formal Dinner Only
  • Formal Dinner: £50

Participants on the Accommodation Package or Registration Package, including organisers and speakers, are automatically included in this event. For all remaining participants who would like to attend, such as programme participants, the above charge will apply.


Accommodation in single study bedrooms with shared facilities and breakfast are provided at TBC.



Lunch timings and location will be confirmed with timetable.

Evening Meal

Participants are free to make their own arrangements for dinner.

Formal Dinner

The Formal Dinner location and date is to be confirmed. Participants on the Accommodation Package or Registration Package, including organisers and speakers, are automatically included in this event.

University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons