Sciweavers

12 search results - page 2 / 3
» Small Weakly Universal Turing Machines
Sort
View
MCU
2007
128views Hardware» more  MCU 2007»
13 years 6 months ago
Small Semi-weakly 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
CORR
2004
Springer
137views Education» more  CORR 2004»
13 years 5 months ago
Implementation of Logical Functions in the Game of Life
: The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generato...
Jean-Philippe Rennard
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
NC
2008
122views Neural Networks» more  NC 2008»
13 years 5 months ago
Computation with finite stochastic chemical reaction networks
A highly desired part of the synthetic biology toolbox is an embedded chemical microcontroller, capable of autonomously following a logic program specified by a set of instructions...
David Soloveichik, Matthew Cook, Erik Winfree, Jeh...