Sciweavers

MCU
1998
119views Hardware» more  MCU 1998»
13 years 11 months ago
DNA Computing Based on Splicing: Universality Results
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
Gheorghe Paun
MCU
1998
93views Hardware» more  MCU 1998»
13 years 11 months ago
Using DNA to solve the Bounded Post Correspondence Problem
Lila Kari, Greg Gloor, Sheng Yu
MCU
1998
154views Hardware» more  MCU 1998»
13 years 11 months ago
A computation-universal two-dimensional 8-state triangular reversible cellular automaton
A reversible cellular automaton (RCA) is a cellular automaton (CA) whose global function is injective and every configuration has at most one predecessor. Margolus showed that the...
Katsunobu Imai, Kenichi Morita
MCU
1998
170views Hardware» more  MCU 1998»
13 years 11 months ago
About the Universality of the Billiard ball model
Block cellular automata (BCA) make local, parallel, synchronous and uniform updates of in nite lattices. In the one-dimensionalcase, there exist BCA with 11 states which are unive...
Jérôme Olivier Durand-Lose
MCU
1998
117views Hardware» more  MCU 1998»
13 years 11 months ago
The Turing Closure of an Archimedean Field
A BSS machine is -uniform if it does not use exact tests; such machines are equivalent (modulo parameters) to Type 2 Turing machines. We define a notion of closure related to Turi...
Paolo Boldi, Sebastiano Vigna