Lower Limits of Frequencies in Computable Sequences and Relativized a Priori Probability
From MaRDI portal
Publication:3785945
DOI10.1137/1132072zbMath0643.68060MaRDI 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
frequency; Kolmogorov complexity; a priori probability; computable function; computable sequence; relativized enumerability
68Q25: Analysis of algorithms and problem complexity
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items