On the Equivalence of Being Typical and Chaotic for Finite Objects
Eugène Asarin · Theory of Probability and Its Applications · 1991
Previous article Next article On the Equivalence of Being Typical and Chaotic for Finite ObjectsE. A. AsarinE. A. Asarinhttps://doi.org/10.1137/1135108PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout"On the Equivalence of Being Typical and Chaotic for Finite Objects." Theory of Probability & Its Applications, 35(4), pp. 760–761[1] A. N. Kolmogorov and , V. A. Uspensky, Algorithms and randomness, Theory Probab. Appl., 32 (1987), 389–412 10.1137/1132060 0648.60005 LinkGoogle Scholar[2] A. N. Kolmogorov, On the logical foundations of probability theoryA. N. Kolmogorov, Probability Theory and Mathematical Statistics, Nauka, Moscow, 1986, 467–471, (In Russian.) Google Scholar[3] Hartley Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill Book Co., New York, 1967xx+482 37:61 Google Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails Volume 35, Issue 4| 1991Theory of Probability & Its Applications625-829 History Submitted:12 October 1988Published online:17 July 2006 InformationCopyright © Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1135108Article page range:pp. 760-761ISSN (print):0040-585XISSN (online):1095-7219Publisher:Society for Industrial and Applied Mathematics