The following pages link to Damien Woods (Q262270):
Displayed 47 items.
- The two-handed tile assembly model is not intrinsically universal (Q262271) (← links)
- The computational power of membrane systems under tight uniformity conditions (Q537860) (← links)
- Lower bounds on the computational power of an optical model of computation (Q926521) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- Optical computing (Q1036535) (← links)
- Thermodynamic binding networks (Q1694444) (← links)
- An optical model of computation (Q1779303) (← links)
- Parallel computation using active self-assembly (Q2003467) (← links)
- The Collatz process embeds a base conversion algorithm (Q2039969) (← links)
- Small fast universal Turing machines (Q2508974) (← links)
- Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy (Q2509952) (← links)
- Yurii Rogozhin's Contributions to the Field of Small Universal Turing Machines (Q2805458) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation (Q2921470) (← links)
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time (Q2986885) (← links)
- (Q3113756) (← links)
- Small Weakly Universal Turing Machines (Q3183617) (← links)
- Random Number Selection in Self-assembly (Q3184765) (← links)
- Membrane Dissolution and Division in P (Q3184773) (← links)
- A Characterisation of NL Using Membrane Systems without Charges and Dissolution (Q3543341) (← links)
- Small Semi-weakly Universal Turing Machines (Q3608492) (← links)
- P-completeness of Cellular Automaton Rule 110 (Q3613755) (← links)
- Small Semi-Weakly Universal Turing Machines (Q3632014) (← links)
- (Q4530007) (← links)
- The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation (Q4977983) (← links)
- Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines (Q4982992) (← links)
- (Q4992866) (← links)
- (Q4992878) (← links)
- The program-size complexity of self-assembled paths (Q5144958) (← links)
- (Q5145159) (← links)
- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile (Q5167756) (← links)
- Parallel Computation Using Active Self-assembly (Q5168495) (← links)
- Uniformity is Weaker than Semi-Uniformity for Some Membrane Systems (Q5259250) (← links)
- The Two-Handed Tile Assembly Model Is Not Intrinsically Universal (Q5326578) (← links)
- Intrinsic universality in tile self-assembly requires cooperation (Q5384017) (← links)
- The Complexity of Small Universal Turing Machines (Q5425384) (← links)
- Optical Computing and Computational Complexity (Q5429208) (← links)
- Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P (Q5452067) (← links)
- Unconventional Computation (Q5479218) (← links)
- Tag Systems and the Complexity of Simple Programs (Q5500609) (← links)
- New Computational Paradigms (Q5717086) (← links)
- Algorithms and Computation (Q5897910) (← links)
- Four Small Universal Turing Machines (Q5901452) (← links)
- Four Small Universal Turing Machines (Q5902079) (← links)
- (Q6076675) (← links)
- (Q6079226) (← links)
- On the hardness of knowing busy beaver values BB(15) and BB(5,4) (Q6373817) (← links)