Journées Calculabilités 2013
April 11 and 12 (Thursday and Friday), Nancy
|
| | |
 |
This event is the second edition of a French yearly meeting. The
first edition took place in Paris in March 2012.
The goal of this event is to gather people that are
interested in computation theory in a broad sense.
All participants are cordially invited to propose a talk on any topic
related to the meeting.
 |
|
|
|
Topics
The main topics are:
- Computability theory (Turing degrees, reductions)
- Computation models (cellular automata, tilings, population
protocols, signal machines, BSS, abstract state machines)
- Algorithmic information theory (Kolmogorov complexity,
randomness)
- Computable analysis
- Reverse mathematics
- Related topics (logic, complexity, set theory...)
|
Contact
This event is organized by Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup and
Emmanuel Jeandel and supported by the
Formal Methods department and the
LORIA. In order to participate to Journées Calculabilités 2013, please send
an email to one of the organizers (firstname.lastname@loria.fr):
registration is free but mandatory.