Sciweavers

10 search results - page 2 / 2
» Four Small Universal Turing Machines
Sort
View
CIE
2007
Springer
13 years 11 months ago
The Complexity of Small Universal Turing Machines
Damien Woods, Turlough Neary
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
13 years 9 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
MST
2002
97views more  MST 2002»
13 years 5 months ago
Programmed Mutagenesis Is Universal
Programmed mutagenesis is a DNA computing system that uses cycles of DNA annealing, ligation, and polymerization to implement programatic rewriting of DNA sequences. We report that...
Julia Khodor, David K. Gifford
ENTCS
2010
96views more  ENTCS 2010»
13 years 2 months ago
Programming in Biomolecular Computation
Our goal is to provide a top-down approach to biomolecular computation. In spite of widespread discussion about connections between biology and computation, one question seems not...
Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen
JUCS
2002
80views more  JUCS 2002»
13 years 5 months ago
On the Power of P Systems with Symport Rules
: A purely communicative variant of P systems was considered recently, based on the trans-membrane transport of couples of chemicals. When using both symport rules (the chemicals p...
Carlos Martín-Vide, Andrei Paun, Gheorghe P...