457 search results - page 7 / 92 » Hypercomputation: computing more than the Turing machine |
ISTCS
1993
Springer
15 years 1 months ago
1993
Springer
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
MFCS
2007
Springer
15 years 3 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
VMCAI
2007
Springer
15 years 3 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 ...
CIE
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Infinite time register machines (ITRMs) are register machines which act on natural numbers and which are allowed to run for arbitrarily many ordinal steps. Successor step...