Computability theory (Turing) and information theory (Shannon) have relations {algorithmic information theory} [Chaitin, 1987] (Andrei N. Kolmogorov) (Ray J. Solomonoff) [1960]. Strings (patterns) have complexity (Kolmogorov complexity). String information is the smallest possible program that generates the string.
A universal computer running a random program has a probability {algorithmic probability} (Solomonoff) [1960] of outputting a string. Strings represent patterns and so algorithmic probability helps study induction.
Mathematical Sciences>Information Theory
Outline of Knowledge Database Home Page
Description of Outline of Knowledge Database
Date Modified: 2022.0224