Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, pages 50#122. Springer Verlag, 1988.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Reflections on Quantum Computing - Calude, Dinneen, Svozil (2000) (1 citation) (Correct)
.... algorithms are not able to achieve this computational power (by a classical result [10] probabilistic algorithms are equivalent to Turing machines) Let us finally notice that by virtue of the same information theoretic argument, the possibility of time travel (see, for example, Nahin [17]) would not solve the halting problem, unless one could travel back and forth in time at a pace exceeding the growth of any computable function. Acknowledgment We thank Greg Chaitin, Garry Tee and Marius Zimand for criticism and encouragement. ....
P. J. Nahin. Time Machines, Springer-Verlag, New York, 1999.
Toward Less Conservative Stability Analysis of Time-Delay.. - Zhang, Knospe, Tsiotras Self-citation (Systems) (Correct)
No context found.
Time-delay Systems, pages 101#116. Springer-Verlag, 1997.
A Semantic Characterisation for Faults in Replicated Systems - Krishnan (1 citation) (Correct)
No context found.
Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, pages 50#122. Springer Verlag, 1988.
Modeling Rational Agents within a BDI-Architecture - Rao, Georgeff (1991) (304 citations) (Correct)
No context found.
Branching Time and Partial Order in Logics and Models for Concurrency, pages 123#172. Springer-Verlag, Berlin, 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC