default search action
5. MCU 2007: Orléans, France
- Jérôme Olivier Durand-Lose, Maurice Margenstern:
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
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 TantrixTM 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
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
Accepting Networks of Splicing Processors with Filtered Connections. 218-229 - Frantisek Mráz
Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata. 230-241 - Turlough Neary
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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-13 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: