5. MCU 2007: Orléans, France

Invited Talks

• Andrew Adamatzky:
  Encapsulating Reaction-Diffusion Computers. 1-11
  
• Olivier Bournez, Emmanuel Hainry:
  On the Computational Capabilities of Several Models. 12-23
  
• Mark Burgin:
  Universality, Reducibility, and Completeness. 24-38
  
• Manuel Lameiras Campagnolo, Kerry Ojakian:
  Using Approximation to Relate Computational Classes over the Reals. 39-61
  
• Joel David Hamkins:
  A Survey of Infinite Time Turing Machines. 62-71
  
• Jarkko Kari:
  The Tiling Problem Revisited (Extended Abstract). 72-79
  
• Pascal Koiran:
  Decision Versus Evaluation in Algebraic Complexity. 80-89
  
• Kenichi Morita, Yoshikazu Yamaguchi:
  A Universal Reversible Turing Machine. 90-98
  
• K. G. Subramanian:
  P Systems and Picture Languages. 99-109
  

Regular Papers

• Artiom Alhazov, Rudolf Freund, Marion Oswald, Sergey Verlan:
  Partial Halting in P Systems Using Membrane Rules with Permitting Contexts. 110-121
  
• Artiom Alhazov, Mario J. Pérez-Jiménez:
  Uniform Solution of. 122-133
  
• Dorothea Baumeister, Jörg Rothe:
  Satisfiability Parsimoniously Reduces to the Tantrix^TM Rotation Puzzle Problem. 134-145
  
• Tommaso Bolognesi:
  Planar Trivalent Network Computation. 146-157
  
• Jürgen Dassow, Bianca Truthe:
  On the Power of Networks of Evolutionary Processors. 158-169
  
• Liesbeth De Mol:
  Study of Limits of Solvability in Tag Systems. 170-181
  
• John Fisher, Marc Bezem:
  Query Completeness of Skolem Machine Computations. 182-192
  
• Hermann Gruber, Markus Holzer, Martin Kutrib:
  More on the Size of Higman-Haines Sets: Effective Constructions. 193-204
  
• Artiom Matveevici, Yurii Rogozhin, Sergey Verlan:
  Insertion-Deletion Systems with One-Sided Contexts. 205-217
  
• Juan Castellanos, Florin Manea, Luis Fernando de Mingo López, Victor Mitrana:
  Accepting Networks of Splicing Processors with Filtered Connections. 218-229
  
• Frantisek Mráz, Friedrich Otto, Martin Plátek:
  Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata. 230-241
  
• Turlough Neary, Damien Woods:
  Four Small Universal Turing Machines. 242-254
  
• Hidenosuke Nishio:
  Changing the Neighborhood of Cellular Automata. 255-266
  
• Alexander Okhotin:
  A Simple P-Complete Problem and Its Representations by Language Equations. 267-278
  
• Olivier Teytaud:
  Slightly Beyond Turing's Computability for Studying Genetic Programming. 279-290
  
• Hiroshi Umeo, Takashi Yanagihara:
  A Smallest Five-State Solution to the Firing Squad Synchronization Problem. 291-302
  
• Damien Woods, Turlough Neary:
  Small Semi-weakly Universal Turing Machines. 303-315
  
• Jean-Baptiste Yunès:
  Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution. 316-324