All public logs
Jump to navigation
Jump to search
Combined display of all available logs of self-assembly wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).
(newest | oldest) View (\(1 | \)2) (20 | 50 | 100 | 250 | 500)- 15:35, 27 May 2014 \(1 deleted page \)3 (content was: "In concentration programming, the concentrations of tile types are used to "program" input to the system. Roughly speaking, the higher the concentration of a part..." (and the only contributor was "Winston"))
- 15:30, 27 May 2014 \(1 deleted page \)3 (content was: "The ''enzyme self-assembly model'', a modified version of aTAM, is based on the ability of ribonuclease (RNase) to catalyze the degradation of RNA, but ..." (and the only contributor was "Wiki admin"))
- 15:29, 27 May 2014 \(1 deleted page \)3 (content was: "One of the most fundamental computational problems in self-assembly is the problem of deciding whether a given self-assembly system uniquely assembles into ..." (and the only contributor was "Wiki admin"))
- 15:29, 27 May 2014 \(1 deleted page \)3 (content was: "A ''staged assembly system'' is a 3-tuple <m>(M_{r,b},\{T_{i,j}\},\{\tau_{i,j}\})</m> where <m>M_{r,b}</m> is an r-stage b-bin mix graph" (and the only contributor was "Wiki admin"))
- 15:24, 27 May 2014 \(1 deleted page \)3 (content was: "== Tiles == Consider some alphabet of glue types $\Pi$. A tile is a finite edge polygon with some finite subset of border points each assigned some glue type from $\Pi$. Further, each glue type $g \in \Pi$ has some rational number str...")
- 15:10, 27 May 2014 \(1 deleted page \)3 (content was: "It is often desirable to quantify a particular aspect of a TAM or construction therein. Several common complexity classes have been identified. Categ..." (and the only contributor was "Wiki admin"))
- 15:10, 27 May 2014 \(1 deleted page \)3 (content was: "The tile complexity (sometimes called the program-size complexity) is the number of unique tile types of the system. Category:Complexity Cl..." (and the only contributor was "Wiki admin"))
- 15:10, 27 May 2014 \(1 deleted page \)3 (content was: "Stage complexity is the number of stages that a particular tile system must progress through in order to produce a terminal assembly. Cate..." (and the only contributor was "Wiki admin"))
- 14:13, 12 August 2013 \(1 uploaded \)3 (The "base" tiles of the Serpenski triangle self-assembling. )
- 12:21, 11 June 2013 \(1 uploaded \)3 (The block used as a replacement in snaked proofreading.)
- 12:20, 11 June 2013 \(1 uploaded \)3 (The block used as a replacement in standard proofreading.)
- 12:20, 11 June 2013 \(1 uploaded \)3 (A tile type from the original, unaltered tile set.)
- 12:00, 11 June 2013 \(1 uploaded \)3 (Replacing a "0-0" rule tile)
- 11:59, 11 June 2013 \(1 uploaded \)3 (Replacing a "0-1" rule tile)
- 11:40, 1 June 2013 \(1 uploaded \)3 (The only new supertile producible after the fourth step of combinations, and which is the unique terminal assembly of the system)
- 11:39, 1 June 2013 \(1 uploaded \)3 (The only new supertile producible after the third step of combinations)
- 11:39, 1 June 2013 \(1 uploaded \)3 (Figure 3: The new supertiles producible after the second step of combinations)
- 11:38, 1 June 2013 \(1 deleted page \)3 (Deleted old revision 20130601163757!2HAM-example-tileset.png: leave me alone)
- 11:37, 1 June 2013 \(1 uploaded a new version of \)3 (Figure 1: The tile set (a.k.a. singleton tiles) for the 2HAM example system)
- 11:37, 1 June 2013 \(1 uploaded \)3 (Figure 2: The new supertiles producible after one step of combinations)
- 11:36, 1 June 2013 \(1 uploaded \)3 (The tile set (a.k.a. singleton tiles) for the 2HAM example system)
- 10:22, 1 June 2013 \(1 uploaded \)3 (A view of the 6 by 6 square of tiles at the bottom right corner of the assembly produced by the binary counter. Note that the terminal assembly would actually continue infinitely far up and to the left.)
- 10:22, 1 June 2013 \(1 uploaded \)3 (Border tiles can attach to the seed and form arbitrarily long bottom and right borders. Rule tiles can bind only once two "inputs" are available.)
- 10:21, 1 June 2013 \(1 deleted page \)3 (typo)
- 10:19, 1 June 2013 \(1 uploaded \)3 (Border tiles can attach to the seed and form arbitrarily long bottom and right borders. Rule tiles can bind only once two ``inputs'' are available.)
- 10:04, 1 June 2013 \(1 uploaded \)3 (The "rule" tile types which compute and represent the values of the counter)
- 10:03, 1 June 2013 \(1 uploaded \)3 (The tile types which form the border of the counter)
- 18:42, 30 May 2013 \(1 uploaded \)3 (Before the erroneously attached tile can detach, another tile attaches with 2 matching bonds so that all tiles are now connected by two correctly formed bonds)
- 18:41, 30 May 2013 \(1 uploaded \)3 (The binding of a tile via a single glue)
- 18:40, 30 May 2013 \(1 uploaded \)3 (A partial assembly which is error-free)
- 12:06, 22 May 2013 \(1 uploaded \)3 (Before the erroneously attached tile can detach, another tile (shown by arrow) attaches with 2 matching bonds so that all tiles are now connected by two correctly formed bonds.)
- 12:04, 22 May 2013 \(1 uploaded \)3 (The binding of a tile with one glue match and one mismatch (shown by arrow).)
- 11:54, 22 May 2013 \(1 uploaded \)3 (A partial assembly which is error-free.)
- 11:49, 22 May 2013 \(1 uploaded \)3 (A view of the $9 \times 9$ square of tiles at the bottom right corner of the weakly self-assembled Sierpinski triangle. Note that the terminal assembly would actually continue infinitely far up and to the left.)
- 11:41, 22 May 2013 \(1 uploaded \)3 (The tile types for weakly self-assembling the Sierpinski triangle.)
- 14:26, 21 May 2013 \(1 deleted page \)3 (Made a new page with a more accurate title.)
- 13:37, 21 May 2013 \(1 deleted page \)3 (Made a new aTAM page.)
- 12:31, 21 May 2013 \(1 uploaded \)3 (An example tile that has glue of strength 0 on the left (W) and bottom (S), glue of color 'a' and strength 2 on the top (N), and glue of color 'b' and strength 1 on the right (E). This tile also has label 'L'.)
- 12:10, 21 May 2013 \(1 uploaded \)3 (An example tile that has glue of strength 0 on the left (W) and bottom (S), glue of color 'a' and strength 2 on the top (N), and glue of color 'b' and strength 1 on the right (E). This tile also has label 'L'.)
- 00:51, 21 May 2013 \(1 deleted page \)3 (Scratch.)
- 20:30, 20 May 2013 \(1 deleted page \)3 (scratch)
- 20:10, 20 May 2013 \(1 deleted page \)3 (scratch)
- 20:05, 20 May 2013 \(1 deleted page \)3 (Scratch.)
- 19:52, 20 May 2013 \(1 deleted page \)3 (From Scratch!)
- 18:11, 20 May 2013 \(1 deleted page \)3 (Starting from scratch.)
- 18:10, 20 May 2013 \(1 deleted page \)3 (Starting from scratch.)
- 18:10, 20 May 2013 \(1 deleted page \)3 (Starting from scratch.)
- 18:09, 20 May 2013 \(1 deleted page \)3 (Starting from scratch.)
- 18:09, 20 May 2013 \(1 deleted page \)3 (Starting from scratch.)
- 23:54, 9 May 2013 \(1 uploaded \)3 (Profile picture for Trent.)
