Varieties of Algorithmic Information is a conference organized as part of the project, "Structure and Randomness in the Theory of Computation." This project is being carried out by Laurent Bienvenu of Université Paris 7 and Christopher Porter of the University of Florida and is funded by the John Templeton Foundation.
The notion of algorithmic information is referred to throughout work in computability theory, algorithmic randomness, and related areas. However, in many cases, this notion of algorithmic information is used both informally and in a number of different senses. The goal of Varieties of Algorithmic Information is to clarify the various notions of algorithmic information as they appear in computability-theoretic investigations, to ascertain the similarities and differences between them, and to foster interaction between mathematicians, computer scientists, and philosophers with interest in the topic.
The main topics of the meeting are:
Algorithmic information theory and randomness
Turing computability (degrees, reductions)
Computable analysis, computable algebra
Reverse mathematics and proof theory
Computable structure theory
Infinitary models of computation (ordinal-time computation, computation over orders, etc)
Computability and definability in set theory
Vasco Brattka (Universität der Bundeswehr, Munich)
Walter Dean (University of Warwick)
Jan Reimann (Penn State University)
Nikolay Vereshchagin (Moscow State University)
Registration is free but mandatory. If you have any questions, please contact the organizers (Laurent Bienvenu, Christopher Porter, Wolfgang Merkle) at
vai [at] computability.fr
cp [at] cpporter.com
To submit an abstract, please click on "Submission" under the main menu (on the left-hand column), enter your registration information, and then you can upload your abstract.