Next: Generalized Kolmogorov Complexity for
Up: HIERARCHIES OF GENERALIZED KOLMOGOROV
Previous: Weak Decidability and Convergence
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
or algorithmic complexity or algorithmic information
the length of the shortest halting program computing :
We will now extend this in novel ways to nonhalting EOMs and GTMs.
Fix a universal MTM or EOM or GTM U with halt instruction,