244 search results - page 44 / 49 » Turing machines and bimachines |
MCU
1998
15 years 1 months ago
1998
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almos...
113
click to vote
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...
115
click to vote
CORR
2004
Springer
14 years 11 months ago
2004
Springer
: The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generato...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Algorithmic entropy can be seen as a special case of entropy as studied in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodyna...