Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami (Q6169891): Difference between revisions

@@ Property / cites work @@
+Running time and program size for self-assembled squares
+Normal rank
@@ Property / cites work @@
+Q5321501
@@ Property / cites work: Q5321501 / rank @@
+Normal rank
@@ Property / cites work @@
+Know when to fold 'em: self-assembly of shapes by folding in oritatami
+Normal rank
@@ Property / cites work @@
+Limitations of self-assembly at temperature 1
@@ Property / cites work: Limitations of self-assembly at temperature 1 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5091013
@@ Property / cites work: Q5091013 / rank @@
+Normal rank
@@ Property / cites work @@
+The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
+Normal rank
@@ Property / cites work @@
+Small Weakly Universal Turing Machines
@@ Property / cites work: Small Weakly Universal Turing Machines / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Small Universal Turing Machines: A Survey
+Normal rank
@@ Property / cites work @@
+Simple intrinsic simulation of cellular automata in oritatami molecular folding model
+Normal rank
@@ Property / cites work @@
+The program-size complexity of self-assembled squares (extended abstract)
+Normal rank
@@ Property / cites work @@
+Polyominoes with minimum site-perimeter and full set achievement games
+Normal rank