default search action
MCU 2013: Zurich, Switzerland
- Turlough Neary, Matthew Cook:
Proceedings Machines, Computations and Universality 2013, MCU 2013, Zürich, Switzerland, September 9-11, 2013. EPTCS 128, 2013 - Kenichi Morita:
Reversible Logic Elements with Memory and Their Universality. 3-14 - Damien Woods:
Intrinsic universality and the computational power of self-assembly. 16-22 - Nathalie Aubrun, Jarkko Kari:
Tiling Problems on Baumslag-Solitar groups. 35-46 - Rudolf Freund, Gheorghe Paun:
How to Obtain Computational Completeness in P Systems with One Catalyst. 47-61 - Rudolf Freund, Sergiu Ivanov, Marion Oswald, K. G. Subramanian:
One-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules. 62-75 - Anthony Gasperin:
Topology and Non-Deterministic Polynomial Time Computation : Avoidance of The Misbehaviour of Hub-Free Diagrams and Consequences. 76-84 - Christian Herrmann, Johanna Sokoli, Martin Ziegler:
Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines. 85-92 - Maurice Margenstern:
About Strongly Universal Cellular Automata. 93-125 - Maurice Margenstern, K. G. Subramanian:
Hyperbolic tilings and formal language theory. 126-136 - Simon Martiel, Bruno Martin:
Intrinsic Universality of Causal Graph Dynamics. 137-149 - Niall Murphy, Damien Woods:
AND and/or OR: Uniform Polynomial-Size Circuits. 150-166 - Jacob Hendricks, Matthew J. Patitz:
On the Equivalence of Cellular Automata and the Tile Assembly Model. 167-189 - Dmitry A. Zaitsev:
A Small Universal Petri Net. 190-202
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.