244 search results - page 4 / 49 » Turing machines and bimachines |
CIE
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we show that closed-form analytic maps and flows can simulate Turing machines in an error-robust manner. The maps and ODEs defining the flows are explicitly obtai...
105
Voted
TCS
2012
13 years 7 months ago
2012
Abstract. The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in th...
117
click to vote
SOFSEM
2012
Springer
13 years 7 months ago
2012
Springer
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 ...
101
Voted
ECCC
2000
14 years 11 months ago
2000
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
91
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
: We consider mixed Dirichlet-Robin problems on scale irregular domains. In particular, we study the asymptotic convergence of the solutions of elliptic problems with Robin boundar...