On the Operating Time of Errorless Probabilistic Turing Machines
R. V. Freĭvald · Theory of Probability and Its Applications · 1988
Previous article Next article On the Operating Time of Errorless Probabilistic Turing MachinesR. V. FreivaldR. V. Freivaldhttps://doi.org/10.1137/1132073PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] A. I. Mal'tsev, Algorithms and Recursive Functions, Nauka, Moscow, 1986, (In Russian.) 0664.03030 Google Scholar[2] R. V. Freivald, Rapid calculations on probabilistic Turing machines, Uchen. Zap. Lat. Gos. Un-ta, 233 (1975), 201–205, (In Russian.) Google Scholar[3] R. V. Freivald, Accelerating recognition of certain sets by applying a random number generatorProblemy Kibernetiki, Vol. 36, Nauka, Moscow, 1979, (In Russian.) Google Scholar[4] Ja. M. Barzdin', Complexity of recognition of symmetry on Turing machines, Problemy Kibernet. No., 15 (1965), 245–248, (In Russian.) 36:1326 Google Scholar[5] A. A. Bukhshtab, Theory of Numbers, Uchpedgiz, Moscow, 1960, (In Russian.) Google Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails Algorithms and RandomnessA. N. Kolmogorov and V. A. UspenskiiTheory of Probability & Its Applications, Vol. 32, No. 3 | 17 July 2006AbstractPDF (3481 KB) Volume 32, Issue 3| 1988Theory of Probability & Its Applications History Submitted:17 April 1987Published online:17 July 2006 InformationCopyright © Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1132073Article page range:pp. 514-516ISSN (print):0040-585XISSN (online):1095-7219Publisher:Society for Industrial and Applied Mathematics