Programme
ProgrammePlease notice that:
| Monday, September the 10th | |
| 9h00 | Registration |
| 10h30 | Opening |
| 11h00 | Invited speaker 1 : Maurice Margenstern Cellular automata in hyperbolic spaces, universality and beyond the Turing barrier slides |
| 12h30 | Lunch |
| 14h00 | Invited speaker 2 : Olivier Bournez On the computational capabilities of several models |
| 15h00 | Accepted papers 1 Artiom Alhazov, Rudolf Freund, Marion Oswald, Sergey Verlan Partial Halting in P Systems Using Membrane Rules with Permitting Contexts Dorothea Baumeister, Jörg Rothe Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem slides |
| 16h45 | Visit of the old city |
| Tuesday, September the 11th | |
| 9h00 | Invited speaker 3 : Kenichi Morita, Yoshikazu Yamaguchi A Universal Reversible Turing Machine slides |
| 10h00 | Coffee break |
| 10h30 | Invited speaker 4 : Mark Burgin Universality, Reducibility, and Completeness |
| 11h30 | Accepted papers 2 Tommaso Bolognesi Planar trivalent network computation Jürgen Dassow, Bianca Truthe On the Power of Networks of Evolutionary Processors |
| 12h30 | Lunch |
| 14h15 | Visit of the Château de Chambord |
| Wednesday, September the 12th | |
| 9h00 | Invited speaker 5 : Manuel Campagnolo, Kerry Ojakian Using Approximation to Relate Computational Classes over the Reals slides |
| 10h00 | Coffee break |
| 10h30 | Invited speaker 6 : Pascal Koiran Decision versus Evaluation in Algebraic Complexity slides |
| 11h30 | Accepted papers 3 Olivier Teytaud Slightly beyond Turing's computability for studying genetic programming slides Hermann Gruber, Markus Holzer, Martin Kutrib More on the Size of Higman-Haines Sets: Effective Constructions slides |
| 12h30 | Lunch |
| 14h00 | Invited speaker 7 : Joel David Hamkins A survey of infinite time Turing machines |
| 15h00 | Accepted papers 4 Hiroshi Umeo A Smallest Five-State Solution to the Firing Squad Synchronization Problem Victor Mitrana, Juan Castellanos, Florin Manea, Luis Fernando Mingo López Accepting Networks of Splicing Processors With Filtered Connections slides |
| 16h00 | Coffee break |
| 16h30 | Accepted papers 5 Turlough Neary, Damien Woods Four small universal Turing machines slides complement Hidenosuke Nishio Changing the Neighborhood of Cellular Automata slides |
| 17h30 | Open session Pablo Arrighi, Renan Fargetton Intrinsically universal one-dimensional quantum cellular automata slides |
| 20h00 | Banquet |
| Thursday, September the 13th | |
| 9h00 | Invited speaker 8 : Jarkko Kari The Tiling Problem Revisited (extended abstract) |
| 10h00 | Coffee break |
| 10h30 | Accepted papers 6 Liesbeth De Mol Study of Limits of Solvability in Tag Systems slides Damien Woods, Turlough Neary Small semi-weakly universal Turing machines slides complement |
| 11h30 | Accepted papers 7 John Fisher, Marc Bezem Query Completeness of Skolem Machine Computations slides Jean-Baptiste Yunès Simple New Algorithms which solve the Firing Squad Synchronization Problem: a 7-states 4n-steps solution slides |
| 12h30 | Lunch |
| 14h00 | Invited speaker 9 : Klaus Sutner Information Hiding and Incompleteness slides |
| 15h00 | Accepted papers 8 Frantisek Mraz, Martin Platek, Friedrich Otto Hierarchical relaxations of the correctness preserving property for restarting automata slides Artiom Matveevici, Yurii Rogozhin, Sergey Verlan Insertion-Deletion Systems with One-Sided Contexts |
| 16h00 | Coffee break |
| 16h30 | Accepted papers 9 Artiom Alhazov, Mario de Jesús Pérez-Jiménez Uniform Solution of QSAT using Polarizationless Active Membranes Alexander Okhotin A simple P-complete problem and its representations by language equations slides |
| 17h30 | Closing |