Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus & Petr Sosík (2009):
The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly.
SIAM Journal on Computing 38(6),
pp. 2356–2381,
doi:10.1137/080723971.
J. Albert & K. Čulik II (1987):
A Simple Universal Cellular Automaton and its One-Way and Totalistic Version.
Complex Systems 1(1),
pp. 1–16.
Pablo Arrighi, Nicolas Schabanel & Guillaume Theyssier (2013):
Stochastic Cellular Automata: Correlations, Decidability and Simulations.
CoRR abs/1304.7185.
Available at http://arxiv.org/abs/1304.7185.
Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M Summers & Andrew Winslow (2013):
Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM.
In: Natacha Portier & Thomas Wilke: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013),
Leibniz International Proceedings in Informatics (LIPIcs) 20.
Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik,
Dagstuhl, Germany,
pp. 172–184,
doi:10.4230/LIPIcs.STACS.2013.172.
Available at http://drops.dagstuhl.de/opus/volltexte/2013/3932.
Matthew Cook, Yunhui Fu & Robert T. Schweller (2011):
Temperature 1 Self-Assembly: Deterministic Assembly in 3D and Probabilistic Assembly in 2D.
In: SODA 2011: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms.
SIAM.
Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger & Guillaume Theyssier (2011):
Bulking I: An abstract theory of bulking.
Theor. Comput. Sci. 412(30),
pp. 3866–3880,
doi:10.1016/j.tcs.2011.02.023.
Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger & Guillaume Theyssier (2011):
Bulking II: Classifications of cellular automata.
Theor. Comput. Sci. 412(30),
pp. 3881–3905,
doi:10.1016/j.tcs.2011.02.024.
Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Matthew J. Patitz, Robert T. Schweller, Andrew Winslow & Damien Woods (2012):
One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece.
Technical Report.
Computing Research Repository.
Available at http://arxiv.org/abs/.
Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers & Damien Woods (2013):
The two-handed assembly model is not intrinsically universal.
In: 40th International Colloquium on Automata, Languages and Programming, ICALP 2013, Riga, Latvia, July 8-12, 2013,
Lecture Notes in Computer Science.
Springer,
doi:10.1007/978-3-642-39206-1_34.
To appear.
David Doty, Jack H. Lutz, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers & Damien Woods (2012):
The tile assembly model is intrinsically universal.
In: Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science,
FOCS 2012,
pp. 302–310,
doi:10.1109/FOCS.2012.76.
David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers & Damien Woods (2009):
Intrinsic Universality in Self-Assembly.
In: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science,
pp. 275–286,
doi:10.1.1.155.3232.
David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers & Damien Woods (2009):
Random Number Selection in Self-assembly.
In: Proceedings of the 8th International Conference on Unconventional Computation,
UC '09.
Springer-Verlag,
Berlin, Heidelberg,
pp. 143–157,
doi:10.1007/978-3-642-03745-0_19.
B. Durand & Zs. Róka (1998):
The game of life: universality revisited.
Technical Report 98-01.
Laboratoire de l'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon,
doi:10.1.1.39.7839.
Bin Fu, Matthew J. Patitz, Robert T. Schweller & Robert Sheline (2012):
Self-assembly with geometric tiles.
In: Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I,
ICALP'12.
Springer-Verlag,
Berlin, Heidelberg,
pp. 714–725,
doi:10.1007/978-3-642-31594-7_60.
Martin Gardner (1970):
Mathematical Games - The fantastic combinations of John Conway's new solitaire game ``life'' 223,
pp. 120–123,
doi:10.1038/scientificamerican1070-120.
E. Goles, P. E. Meunier, I. Rapaport & G. Theyssier (2011):
Communication complexity and intrinsic universality in cellular automata.
Theor. Comput. Sci. 412(1-2),
pp. 2–21,
doi:10.1016/j.tcs.2010.10.005.
James I. Lathrop, Jack H. Lutz & Scott M. Summers (2009):
Strict self-assembly of discrete Sierpinski triangles.
Theor. Comput. Sci. 410(4-5),
pp. 384–405,
doi:10.1016/j.tcs.2008.09.062.
Pierre-Etienne Meunier, Matthew J. Patitz, Scott M. Summers, Guillaume Theyssier, Andrew Winslow & Damien Woods (2013):
Intrinsic universality in tile self-assembly requires cooperation.
CoRR abs/1304.1679.
Available at http://arxiv.org/abs/1304.1679.
Nicolas Ollinger (2003):
The Intrinsic Universality Problem of One-Dimensional Cellular Automata.
In: H. Alt & M. Habib: 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS),
LNCS 2607.
Springer,
pp. 632–641,
doi:10.1007/3-540-36494-3_55.
Nicolas Ollinger (2009):
Intrinsically Universal Cellular Automata.
In: T. Neary, D. Woods, A.K. Seda & N. Murphy: Proceedings International Workshop on The Complexity of Simple Programs, Cork, Ireland, 6-7th December 2008,
EPTCS 1,
pp. 199–204,
doi:10.1.1.248.9665.
ArXiv:0906.3213v1 [cs.CC].
Paul Rendell (2011):
A Universal Turing Machine in Conway's Game of Life.
In: HPCS,
pp. 764–772,
doi:10.1109/HPCSim.2011.5999906.
Paul W. K. Rothemund & Erik Winfree (2000):
The Program-size Complexity of Self-Assembled Squares (extended abstract).
In: STOC '00: Proceedings of the thirty-second annual ACM Symposium on Theory of Computing.
ACM,
Portland, Oregon, United States,
pp. 459–468,
doi:10.1145/335305.335358.
Hao Wang (1961):
Proving Theorems by Pattern Recognition – II.
The Bell System Technical Journal XL(1),
pp. 1–41,
doi:10.1007/978-94-009-2356-0_9.
Erik Winfree (1998):
Algorithmic Self-Assembly of DNA.
California Institute of Technology.
Erik Winfree, Xiaoping Yang & Nadrian C. Seeman (1996):
Universal Computation via Self-assembly of DNA: Some Theory and Experiments.
In: DNA Based Computers II, volume 44 of DIMACS.
American Mathematical Society,
pp. 191–213.
eptcs@eptcs.org