Directed non-cooperative tile assembly is decidable

DOI10.4230/LIPICS.DNA.27.6OpenAlexW3203900216MaRDI QIDQ6076673FDOQ6076673

Authors: Pierre Meunier, Damien Regnault 

Publication date: 21 September 2023

Full work available at URL: https://hal.archives-ouvertes.fr/hal-03362845

Recommendations

• The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
• scientific article; zbMATH DE number 6351478
• Self-assembly of decidable sets
• Universal computation with arbitrary polyomino tiles in non-cooperative self-assembly
• Self-assembly of Decidable Sets

zbMATH Keywords

computational geometrymolecular computingself-assemblymodels of computation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other nonclassical models of computation (68Q09) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cited In (2)

• The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
• The Two-Handed Tile Assembly Model Is Not Intrinsically Universal

This page was built for publication: Directed non-cooperative tile assembly is decidable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076673)