562 search results - page 25 / 113 » Concurrent Turing Machines |
TCS
2008
14 years 11 months ago
2008
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
195
click to vote
ICFP
2009
ACM
16 years 12 days ago
2009
ACM
rrent ML, synchronization abstractions can be defined and passed as values, much like functions in ML. This mechanism admits a powerful, modular style of concurrent programming, c...
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
— We aim to search for cellular automata candidate to an automatic system for the demonstration of collision-based universality and that can be able to simulate Turing machines i...
DLT
2010
15 years 1 months ago
2010
Abstract. We prove that uniform and semi-uniform families of P systems with active membranes using only communication and nonelementary division rules are not computationally unive...
MCU
2001
15 years 1 months ago
2001
Abstract. A direct universal extended H system receives as input the coding of an extended H system with double splicing and simulates it. It is the first time that a direct constr...