Recursively Enumerable Instantaneous Codes
In this chapter — which is basically technical — we present two main tools used to design Chaitin computers and consequently to establish upper bounds: the extension of the Kraft condition (see Theorem 2.8) to arbitrary r.e. sets and relativized computation. New formulae, closely analogous to expressions in classical information theory, are derived.
KeywordsInitial Segment Universal Computer Prefix Code Graph Approximation Code Theorem
Unable to display preview. Download preview PDF.