The 11th International Conference on Computability, Complexity and Randomness (CCR 2016) was held in Honolulu, Hawaii, from January 4th to 8th, hosted by the University of Hawaii at Manoa.
Financial support was given by the National Science Foundation (NSF) under Grant No. 1545707 and by the Simons Foundation under a Collaboration Grant for Mathematicians (#315188 to Bjørn Kjos-Hanssen).
The auditorium fees and coffee services were sponsored by the Mathematics Department at University of Hawaii at Manoa.
The local organizing committee consisted of Bjørn Kjos-Hanssen (chair and PI), Mushfeq Khan (co-PI), Achilles Beros, Dale Myers, David Ross, and Dusko Pavlovic.
It was the eleventh in a series of meetings started in 2004 with the aim of supporting research in algorithmic randomness and related areas.
The conference had the scientific sponsorship of
the Association for Symbolic Logic (ASL),
the Association for Women in Mathematics (AWM),
the European Association for Theoretical Computer Science (EATCS), and
the European Association for Computer Science Logic.
The members of the Program Committee were
Laurent Bienvenu (Paris, France),
Rod Downey (Wellington, New Zealand) (co-chair),
Johanna Franklin (Hempstead, New York, USA),
Denis Hirschfeldt (Chicago, Illinois, USA) (co-chair),
Bjørn Kjos-Hanssen (Honolulu, Hawaii, USA),
Jack Lutz (Ames, Iowa, USA),
Elvira Mayordomo (Zaragoza, Spain),
Joe Miller (Madison, Wisconsin, USA),
Kenshi Miyabe (Tokyo, Japan),
Andrei Romashchenko (Montpellier, France),
Henry Towsner (Philadelphia, Pennsylvania, USA), and
Nikolai Vereshchagin (Moscow, Russia).
There were eight invited talks:
Uri Andrews (University of Wisconsin, Madison — USA),
Connections Between Computation and Geometry.
Rutger Kuyper (University of Wisconsin, Madison — USA),
Symmetric differences and random sets.
Satyadev Nandakumar (Indian Institute of Technology, Kanpur),
Pseudorandomness and Dimension.
Ron Peretz (Bar-Ilan University — Israel),
Effective martingales with restricted wagers.
Cristóbal Rojas (Universidad Andrés Bello — Chile),
Computability and complexity of random perturbations of dynamical systems.
Jeffrey Shallit (University of Waterloo – Ontario, Canada),
Separating Words With Automata.
Dan Turetsky (Victoria University of Wellington — New Zealand),
The complexity of free abelian groups.
Linda Westrick (Victoria University of Wellington — New Zealand),
Seas of squares with sizes from a co-enumerable set.
The program also included three tutorial lectures by Lance Fortnow (Georgia Tech) on Bounding rationality with computation
and a public talk by Fortnow of the same title. The public talk was filmed by local television station ThinkTech Hawaii, and program committee chair Rod Downey gave an interview.
After the conference several participants stayed another week for an informal post-conference workshop.
A special issue of Theory of Computing Systems is planned for peer-reviewed full versions of a selection of papers presented at, or related to the topics of, the meeting.