Recursively Enumerable Instantaneous Codes

  • Cristian Calude
Part of the Monographs in Theoretical Computer Science An EATCS Series book series (EATCS)

Abstract

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.

Keywords

Prefix Incompressibility 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Cristian Calude
    • 1
    • 2
  1. 1.Department of Computer ScienceAuckland UniversityAucklandNew Zealand
  2. 2.Faculty of MathematicsBucharest UniversityBucharestRomania

Personalised recommendations