Complexity of Constructive Descriptions

The remaining sections of this paper contain its main contributions, embedded in the context of earlier work.

Traditionally, the Kolmogorov complexity [25,40,13] or algorithmic complexity or algorithmic information of is the length of the shortest halting program computing :

- Generalized Kolmogorov Complexity for EOMs and GTMs
- Expressiveness of EOMs and GTMs

- Which is the ``True'' Information Content of ?
- Relation to Conditional Complexity

Juergen Schmidhuber 2003-02-13