5. MCU 2007: Orléans, France

Jérôme Olivier Durand-Lose, Maurice Margenstern (Eds.): Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007, Proceedings. Lecture Notes in Computer Science 4664 Springer 2007, ISBN 978-3-540-74592-1 BibTeX

Invited Talks

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

Regular Papers

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