D
Damien Woods
Researcher at Maynooth University
Publications - 93
Citations - 2729
Damien Woods is an academic researcher from Maynooth University. The author has contributed to research in topics: Turing machine & Model of computation. The author has an hindex of 26, co-authored 92 publications receiving 2371 citations. Previous affiliations of Damien Woods include University of Seville & California Institute of Technology.
Papers
More filters
Journal ArticleDOI
A cargo-sorting DNA robot.
Anupama J. Thubagere,Wei Li,Robert F. Johnson,Zibo Chen,Shayan Doroudi,Yae Lim Lee,Gregory Izatt,Sarah Wittman,Niranjan Srinivas,Damien Woods,Erik Winfree,Lulu Qian +11 more
TL;DR: A DNA robot is demonstrated that performs a nanomechanical task substantially more sophisticated than previous work and modularity could allow diverse new functions performed by robots using the same set of building blocks.
Journal ArticleDOI
Diverse and robust molecular algorithms using reprogrammable DNA self-assembly
Damien Woods,Damien Woods,Damien Woods,David Doty,David Doty,Cameron Myhrvold,Cameron Myhrvold,Joy Hui,Joy Hui,Felix Zhou,Felix Zhou,Peng Yin,Peng Yin,Erik Winfree +13 more
TL;DR: A set of 355 self-assembling DNA ‘tiles’ can be reprogrammed to implement many different computer algorithms—including sorting, palindrome testing and divisibility by three—suggesting that molecular self-assembly could be a reliable algorithmic component in programmable chemical systems.
Proceedings ArticleDOI
The Tile Assembly Model is Intrinsically Universal
TL;DR: It is proved that the abstract Tile Assembly Model (aTAM) of nanoscale self-assembly is intrinsically universal, which means that there is a single tile assembly system U that, with proper initialization, simulates anytile assembly system T.
Journal ArticleDOI
Optical computing: Photonic neural networks
Damien Woods,Thomas J. Naughton +1 more
TL;DR: Optical computers will be more interesting if they take advantage of phenomena that are unique to optics as discussed by the authors, and in this respect, telecommunications hardware might have something to offer, but it is difficult to find the optimal combination of hardware and software.
Proceedings ArticleDOI
Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
TL;DR: The main results show how to grow arbitrary connected two-dimensional geometric shapes and patterns in expected time polylogarithmic in the size of the shape plus roughly the time required to run a Turing machine deciding whether or not a given pixel is in the shape.