FORMATS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Well-known hierarchies discriminate between the computational power of discrete time and space dynamical systems. A contrario the situation is more confused for dynamical...
CIE
2006
Springer
13 years 8 months ago
2006
Springer
Wegner and Eberbach[Weg04b] have argued that there are fundamental limitations to Turing Machines as a foundation of computability and that these can be overcome by so-called super...
COLT
1992
Springer
13 years 8 months ago
1992
Springer
This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal&q...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Turing machines exposed to a small stochastic noise are considered. An exact characterisation of their (≈ Π0 2 ) computational power (as noise level tends to 0) is obt...
FCT
2005
Springer
13 years 10 months ago
2005
Springer
Unambiguity in alternating Turing machines has received considerable attention in the context of analyzing globally-unique games by Aida et al. [ACRW04] and in the design of effic...
CSL
2005
Springer
13 years 10 months ago
2005
Springer
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
CIE
2005
Springer
13 years 10 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...
SIGCSE
2006
ACM
13 years 10 months ago
2006
ACM
We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are te...
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...
VMCAI
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...