562 search results - page 22 / 113 » Concurrent Turing Machines |
JAPLL
2007
14 years 11 months ago
2007
We investigate the notion of an execution architecture in the setting of the program algebra PGA, and distinguish two sorts of these: analytic architectures, designed for the purp...
TCS
2010
14 years 10 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...
98
Voted
BIRTHDAY
2010
Springer
14 years 9 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 ...
128
Voted
ICGA
2010
14 years 6 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...
ESWS
2008
Springer
15 years 1 months ago
2008
Springer
tract State Machines to Concurrent Transaction Logic Dumitru Roman1 , Michael Kifer2 , and Dieter Fensel1 1 STI Innsbruck, Austria 2 State University of New York at Stony Brook, US...