Gurevich, Y. (1988) The logic in computer science column. Bull. European Assoc. Theor. Comp. Sci., 35, 71--82. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Algorithmic Complexity and Stochastic Properties of Finite Binary .. - V'Yugin (1999) (2 citations) (Correct)
....the proof is analogous to that of Theorem 1. The logarithmic term in (40) requires a linear time of simulation. To prove Theorem 23 below we also need to specify the model of computation. It is not known and probably not true that this theorem holds in the Turing model (see a popular discussion in [46]) The Kolmogorov Uspensky machines, which are usually used, are algorithms with semilocal transformation of information, see [18, Section 1.2, 47] An additional requirement is that any machine from this class does not use any special mark for the end of the program and decides itself when to ....
Gurevich, Y. (1988) The logic in computer science column. Bull. European Assoc. Theor. Comp. Sci., 35, 71--82.
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