MCU C

14 papers

YearTitle / Authors
2013A Small Universal Petri Net.
Dmitry A. Zaitsev
2013AND and/or OR: Uniform Polynomial-Size Circuits
Niall Murphy, Damien Woods
2013About Strongly Universal Cellular Automata
Maurice Margenstern
2013How to Obtain Computational Completeness in P Systems with One Catalyst.
Rudolf Freund, Gheorghe Paun
2013Hyperbolic tilings and formal language theory.
Maurice Margenstern, K. G. Subramanian
2013Intrinsic Universality of Causal Graph Dynamics.
Simon Martiel, Bruno Martin
2013Intrinsic universality and the computational power of self-assembly.
Damien Woods
2013On the Equivalence of Cellular Automata and the Tile Assembly Model.
Jacob Hendricks, Matthew J. Patitz
2013One-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules.
Rudolf Freund, Sergiu Ivanov, Marion Oswald, K. G. Subramanian
2013Proceedings Machines, Computations and Universality 2013, MCU 2013, Zürich, Switzerland, September 9-11, 2013.
Turlough Neary, Matthew Cook
2013Reversible Logic Elements with Memory and Their Universality.
Kenichi Morita
2013Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines.
Christian Herrmann, Johanna Sokoli, Martin Ziegler
2013Tiling Problems on Baumslag-Solitar groups.
Nathalie Aubrun, Jarkko Kari
2013Topology and Non-Deterministic Polynomial Time Computation : Avoidance of The Misbehaviour of Hub-Free Diagrams and Consequences.
Anthony Gasperin