Some Theorems on the Algorithmic Approach to Probability Theory and Information Theory

TL;DR

This dissertation explores the intersection of algorithmic methods with probability and information theory, presenting new theorems and insights that extend prior results from the early 1970s.

Contribution

It introduces novel theorems on the algorithmic approach to probability and information theory, filling gaps left by earlier publications and unpublished details.

Findings

New theorems on algorithmic probability and information theory

Extended results not previously published

Potential relevance for future research in the field

Abstract

This is a 1971 dissertation. Only its extended abstract was published at the time. While some results appeared in other publications, a number of details remained unpublished and may still have relevance.