All public logs

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).

• 12:20, 30 July 2022 \(1 created page \)3 (Figure 2 from "DNA walker circuits: computational potential, design, and verification" by Dannenberg et al (2014).)
• 12:20, 30 July 2022 \(1 uploaded \)3 (Figure 2 from "DNA walker circuits: computational potential, design, and verification" by Dannenberg et al (2014).)
• 14:35, 29 July 2022 \(1 created page \)3 (Figure 1 from "DNA walker circuits: computational potential, design, and verification" by Dannenberg et al (2014).)
• 14:35, 29 July 2022 \(1 uploaded \)3 (Figure 1 from "DNA walker circuits: computational potential, design, and verification" by Dannenberg et al (2014).)
• 12:55, 25 July 2022 \(1 created page \)3 (Created page with "{{PaperTemplate |date=2014/06/07 |abstract=Unlike their traditional, silicon counterparts, DNA computers have natural interfaces with both chemical and biological systems. The...")
• 16:20, 13 July 2022 \(1 created page \)3 (Created page with "Category:Self-assembly ==Overview== A typical aTAM tile set capable of universal computation can be quite large. Using mazes consisting of polyominoes, much smaller tile s...")
• 13:48, 13 July 2022 \(1 created page \)3 (Figure 3 from "Small tile sets that compute while solving mazes" by Cook et al (2021).)
• 13:48, 13 July 2022 \(1 uploaded \)3 (Figure 3 from "Small tile sets that compute while solving mazes" by Cook et al (2021).)
• 13:43, 13 July 2022 \(1 created page \)3 (Figure 3 from "Small tile sets that compute while solving mazes" by Cook et al (2021).)
• 13:43, 13 July 2022 \(1 uploaded \)3 (Figure 3 from "Small tile sets that compute while solving mazes" by Cook et al (2021).)
• 13:24, 13 July 2022 \(1 created page \)3 (Figure 2 from "Small tile sets that compute while solving mazes" by Cook et al (2021).)
• 13:24, 13 July 2022 \(1 uploaded \)3 (Figure 2 from "Small tile sets that compute while solving mazes" by Cook et al (2021).)
• 13:11, 13 July 2022 \(1 created page \)3 (Figure 1 from "Small tile sets that compute while solving mazes" by Cook et al (2021).)
• 13:11, 13 July 2022 \(1 uploaded \)3 (Figure 1 from "Small tile sets that compute while solving mazes" by Cook et al (2021).)
• 10:57, 13 July 2022 \(1 created page \)3 (Created page with "{{PaperTemplate |date=2021/06/30 |abstract=We ask the question of how small a self-assembling set of tiles can be yet have interesting computational behaviour. We study this q...")
• 11:22, 24 June 2022 \(1 created page \)3 (Created page with "{{PaperTemplate |date=2017/09/15 |abstract=Two critical challenges in the design and synthesis of molecular robots are modularity and algorithm simplicity. We demonstrate thre...")
• 13:34, 14 June 2022 \(1 created page \)3 (Covert Computation in Self-Assembled Circuits by Cantu et al. p. 17)
• 13:34, 14 June 2022 \(1 uploaded \)3 (Covert Computation in Self-Assembled Circuits by Cantu et al. p. 17)
• 11:52, 14 June 2022 \(1 created page \)3 (Covert Computation in Self-Assembled Circuits by Cantu et al. p. 10)
• 11:52, 14 June 2022 \(1 uploaded \)3 (Covert Computation in Self-Assembled Circuits by Cantu et al. p. 10)
• 11:46, 14 June 2022 \(1 uploaded a new version of \)3 (Cropped the bottom edge.)
• 11:44, 14 June 2022 \(1 created page \)3 (Covert Computation in Self-Assembled Circuits by Cantu et al. p. 10)
• 11:44, 14 June 2022 \(1 uploaded \)3 (Covert Computation in Self-Assembled Circuits by Cantu et al. p. 10)
• 11:09, 14 June 2022 \(1 created page \)3 (Created page with "Category:Self-assembly ==Overview== Typically, algorithmic self-assembly leaves behind a permanent record of every step of the computation in the form of a final assembly....")
• 10:49, 14 June 2022 \(1 created page \)3 (Covert Computation in Self-Assembled Circuits by Cantu, et al. p. 9)
• 10:49, 14 June 2022 \(1 uploaded \)3 (Covert Computation in Self-Assembled Circuits by Cantu, et al. p. 9)
• 10:42, 14 June 2022 \(1 created page \)3 (Covert Computation in Self-Assembled Circuits by Cantu, et al. p. 8)
• 10:42, 14 June 2022 \(1 uploaded \)3 (Covert Computation in Self-Assembled Circuits by Cantu, et al. p. 8)
• 09:15, 14 June 2022 \(1 created page \)3 (Created page with "{{PaperTemplate |date=2019/08/16 |abstract=Traditionally, computation within self-assembly models is hard to conceal because the self-assembly process generates a crystalline...")