An Algorithmic Approach to Information Theory
Classical probability theory is based on the well known axioms of Kolmogoroff. A characteristic difficulty of this measure-theoretic approach is the physical interpretation of probability: we can observe only the frequency of events and the order in which they occur, not however the probability in the axiomatic sense. Attempts to formulate a frequency theory of probability are quite old, but it was not until the fundamental work of C.P. Schnorr (1971) that there existed a complete canonical theory of probability and randomness based on the concept of an effective (that is, computable) procedure to detect possible regularities in a sequence of events.
KeywordsTuring Machine Initial Segment Binary Sequence Growth Function Code Word
Unable to display preview. Download preview PDF.
- Bremermann, H.: Complexity of automata, brains and behaviour, this volumeGoogle Scholar
- Heim, R.: The algorithmic foundation of information theory, to appearGoogle Scholar
- Kolmogoroff, A.: Three approaches for defining the concept of information quantity, Information Transmission 1, 3 – 11 (1964)Google Scholar
- Scnorr, C.P.: Zufälligkeit und Wahrscheinlichkeit, Lecture Notes in Mathematics 218, Springer-Verlag Berlin, Heidelberg, New York (1971)Google Scholar