Lower Limits of Frequencies in Computable Sequences and Relativized a Priori Probability
From MaRDI portal
Publication:3785945
DOI10.1137/1132072zbMath0643.68060OpenAlexW1971832840MaRDI QIDQ3785945
Publication date: 1987
Published in: Theory of Probability & Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1132072
frequencyKolmogorov complexitya priori probabilitycomputable functioncomputable sequencerelativized enumerability
Analysis of algorithms and problem complexity (68Q25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items