Algorithmic Complexity and Randomness: Recent Developments

From MaRDI portal

Revision as of 01:19, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4007616

Jump to:navigation, search

DOI10.1137/1137017zbMath0815.60003OpenAlexW2026433240MaRDI QIDQ4007616

No author found.

Publication date: 27 September 1992

Published in: Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1137017

zbMATH Keywords

entropy complexity generation of random numbers algorithmic definition of randomness

Mathematics Subject Classification ID

Foundations of probability theory (60A99)

Related Items (3)

Every 2-random real is Kolmogorov random ⋮ There is no SW-complete c.e. real ⋮ Large data series: modeling the usual to identify the unusual.

This page was built for publication: Algorithmic Complexity and Randomness: Recent Developments

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4007616&oldid=17704870"