Machines, Computations and Universality
September 9-11, 2013
University of Zürich, Switzerland
Tiling Problems on Baumslag-Solitar groups
Nathalie Aubrun and Jarkko Kari
How to Obtain Universality in P Systems with One Catalyst
Rudolf Freund and Gheorghe Păun
One-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules
Rudolf Freund, Sergiu Ivanov, Marion Oswald and K.G. Subramanian
Topology and Non-Deterministic Polynomial Time Computation : Avoidance of The Misbehaviour of Hub-Free Diagrams and Consequences
Anthony Gasperin
Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines
Christian Herrmann, Johanna Sokoli and Martin Ziegler
About Strongly Universal Cellular Automata
Maurice Margenstern
Hyperbolic tilings and formal language theory
Maurice Margenstern and K.G. Subramanian
Intrinsic Universality of Causal Graph Dynamics
Simon Martiel and Bruno Martin
AND and/or OR: Uniform Polynomial-Size Circuits
Niall Murphy and Damien Woods
On the Equivalence of Cellular Automata and the Tile Assembly Model
Matthew Patitz and Jacob Hendricks
Small Universal Petri Net
Dmitry Zaitsev
Informal Presentations
(An Outline Of) A Fault-Tolerant Turing Machine
Ilir Çapuni
Formal Language Questions for Eulerian Trails
Henning Fernau and Meenakshi Paramasivan
Array Automata on Cayley Grids
Rudolf Freund and Marion Oswald
Fractal Dimension of Space-time Diagrams and the Runtime Complexity of Small Turing Machines
Joost Joosten, Fernando Soler-Toscano and Hector Zenil
Causal sets for geometrical Gandy machines and Gandy machines over multisets
Adam Obtułowicz
Machine Spaces: Axioms and Metrics
Jörg Zimmermann and Armin Cremers