Damien Woods

From MaRDI portal
Person:262270

Available identifiers

zbMath Open woods.damienMaRDI QIDQ262270

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q60792262023-10-27Paper
https://portal.mardi4nfdi.de/entity/Q60766752023-09-21Paper
On the hardness of knowing busy beaver values BB(15) and BB(5,4)2021-07-26Paper
The Collatz process embeds a base conversion algorithm2021-07-06Paper
https://portal.mardi4nfdi.de/entity/Q49928662021-06-10Paper
https://portal.mardi4nfdi.de/entity/Q49928782021-06-10Paper
https://portal.mardi4nfdi.de/entity/Q51451592021-01-20Paper
The program-size complexity of self-assembled paths2021-01-19Paper
Parallel computation using active self-assembly2019-07-08Paper
Intrinsic universality in tile self-assembly requires cooperation2019-06-20Paper
Thermodynamic binding networks2018-02-02Paper
The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation2017-08-17Paper
Active self-assembly of algorithmic shapes and patterns in polylogarithmic time2017-05-16Paper
Yurii Rogozhin's Contributions to the Field of Small Universal Turing Machines2016-05-11Paper
The two-handed tile assembly model is not intrinsically universal2016-03-29Paper
Tag Systems and the Complexity of Simple Programs2015-08-07Paper
Uniformity is Weaker than Semi-Uniformity for Some Membrane Systems2015-06-26Paper
Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines2015-04-14Paper
Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation2014-10-08Paper
Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy2014-07-31Paper
Parallel Computation Using Active Self-assembly2014-07-07Paper
One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile2014-07-01Paper
The Two-Handed Tile Assembly Model Is Not Intrinsically Universal2013-08-06Paper
The Complexity of Small Universal Turing Machines: A Survey2012-06-15Paper
https://portal.mardi4nfdi.de/entity/Q31137562012-01-23Paper
The computational power of membrane systems under tight uniformity conditions2011-05-23Paper
Optical computing2009-11-13Paper
Random Number Selection in Self-assembly2009-10-22Paper
Membrane Dissolution and Division in P2009-10-22Paper
Small Weakly Universal Turing Machines2009-10-20Paper
Small Semi-Weakly Universal Turing Machines2009-06-23Paper
Four Small Universal Turing Machines2009-06-23Paper
P-completeness of Cellular Automaton Rule 1102009-03-12Paper
Small Semi-weakly Universal Turing Machines2009-03-05Paper
Four Small Universal Turing Machines2009-03-05Paper
The complexity of small universal Turing machines: A survey2009-03-02Paper
A Characterisation of NL Using Membrane Systems without Charges and Dissolution2008-12-02Paper
Lower bounds on the computational power of an optical model of computation2008-05-20Paper
Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P2008-03-28Paper
Optical Computing and Computational Complexity2007-11-29Paper
The Complexity of Small Universal Turing Machines2007-11-13Paper
Algorithms and Computation2006-11-14Paper
Small fast universal Turing machines2006-10-20Paper
Unconventional Computation2006-07-07Paper
New Computational Paradigms2006-01-11Paper
An optical model of computation2005-06-01Paper
https://portal.mardi4nfdi.de/entity/Q45300072002-05-07Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Damien Woods