Introduction

The thesis addresses the history of Algorithmic Information Theory, also known as Kolmogorov Complexity, with the research section adding to this history with the examination of a ‘sub-maximal measure of Kolmogorov Complexity’. I will use the terms Algorithmic Information Theory and Kolmogorov Complexity synonymously during the course of this thesis.