244 search results - page 14 / 49 » Turing machines and bimachines |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
geometrical computation 4: small Turing universal signal machines J
VMCAI
2007
Springer
14 years 1 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 ...
TCS
2010
13 years 5 months ago
2010
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
BIRTHDAY
2010
Springer
13 years 4 months ago
2010
Springer
In [7] Nash, Remmel, and Vianu have raised the question whether a logic L, already introduced by Gurevich in 1988, captures polynomial time, and they give a reformulation of this ...
ICGA
2010
13 years 2 months ago
2010
The debate in philosophy and cognitive science about the Chinese Room Argument has focused on whether it shows that machines can have minds. We present a quantitative argument whi...