Sciweavers

5 search results - page 1 / 1
» The Transfinite Action of 1 Tape Turing Machines
Sort
View
CIE
2005
Springer
13 years 9 months ago
The Transfinite Action of 1 Tape Turing Machines
• We produce a classification of the pointclasses of sets of reals produced by infinite time turing machines with 1-tape. The reason for choosing this formalism is that it appa...
Philip D. Welch
SOFSEM
2012
Springer
11 years 11 months ago
Turing Machines for Dummies - Why Representations Do Matter
Abstract. Various methods exists in the literature for denoting the configuration of a Turing Machine. A key difference is whether the head position is indicated by some integer ...
Peter van Emde Boas
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 4 months ago
Reversal Complexity Revisited
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
André Hernich, Nicole Schweikardt
DNA
2005
Springer
154views Bioinformatics» more  DNA 2005»
13 years 9 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
13 years 9 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