562 search results - page 14 / 113 » Concurrent Turing Machines |
114
Voted
IANDC
2007
14 years 11 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
114
click to vote
FOSSACS
2011
Springer
14 years 3 months ago
2011
Springer
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
TAMC
2009
Springer
15 years 6 months ago
2009
Springer
Computability concerns information with a causal – typically algorithmic – structure. As such, it provides a schematic analysis of many naturally occurring situations. We look ...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Most research into hypercomputation focuses only on machines able to prove stronger results the basic Turing Machine, hence the phrase hypercomputation. However, developing hyperco...
ECCC
2002
14 years 11 months ago
2002
Would physical laws permit the construction of computing machines that are capable of solving some problems much faster than the standard computational model? Recent evidence sugge...