Sciweavers

242 search results - page 37 / 49
» Zigzags in Turing Machines
Sort
View
DAM
1998
88views more  DAM 1998»
13 years 7 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov
ML
2007
ACM
122views Machine Learning» more  ML 2007»
13 years 7 months ago
Status report: hot pickles, and how to serve them
The need for flexible forms of serialisation arises under many circumstances, e.g. for doing high-level inter-process communication or to achieve persistence. Many languages, inc...
Andreas Rossberg, Guido Tack, Leif Kornstaedt
DNA
2005
Springer
154views Bioinformatics» more  DNA 2005»
14 years 1 months ago
Design of Autonomous DNA Cellular Automata
Recent experimental progress in DNA lattice construction, DNA robotics, and DNA computing provides the basis for designing DNA cellular computing devices, i.e. autonomous nano-mech...
Peng Yin, Sudheer Sahu, Andrew J. Turberfield, Joh...
LPAR
2005
Springer
14 years 1 months ago
The Four Sons of Penrose
Abstract. We distill Penrose’s argument against the “artificial intelligence premiss”, and analyze its logical alternatives. We then clarify the different positions one can...
Nachum Dershowitz
MCU
1998
119views Hardware» more  MCU 1998»
13 years 9 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