9 citations · 23 across the 5 of their papers we have counts for
6 papers
Synthesizing and tuning chemical reaction networks with specified behaviours
Neil Dalchau, Niall Murphy, Rasmus Petersen +1
We consider how to generate chemical reaction networks (CRNs) from functional specifications. We propose a two-stage approach that combines synthesis by satisfiability modulo theor…
Uniformity is weaker than semi-uniformity for some membrane systems
Niall Murphy, Damien Woods
We investigate computing models that are presented as families of finite computing devices with a uniformity condition on the entire family. Examples of such models include Boolean…
Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy
Turlough Neary, Damien Woods, Niall Murphy +1
In the 1960's Gisbert Hasenjaeger built Turing Machines from electromechanical relays and uniselectors. Recently, Glaschick reverse engineered the program of one of these machines…
AND and/or OR: Uniform Polynomial-Size Circuits
Niall Murphy, Damien Woods
We investigate the complexity of uniform OR circuits and AND circuits of polynomial-size and depth. As their name suggests, OR circuits have OR gates as their computation gates, as…
Proceedings International Workshop on The Complexity of Simple Programs
Turlough Neary, Damien Woods, Anthony K. Seda +1
This is the first volume of Electronic Proceedings in Theoretical Computer Science (EPTCS), a free international refereed open access venue for the rapid electronic publication of…
On acceptance conditions for membrane systems: characterisations of L and NL
Niall Murphy, Damien Woods
In this paper we investigate the affect of various acceptance conditions on recogniser membrane systems without dissolution. We demonstrate that two particular acceptance condition…