Abstract
In this chapter I’ll present a very general technique, which I’ll call Kraft, for constructing self-delimiting computers by generating their input/output graphs. This is our most basic tool. We’ll use it many times: over and over again in what’s left of Part II and in Part III. In fact, using this technique is at the heart of the next two chapters, it’s really what these two chapters are about.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag London
About this chapter
Cite this chapter
Chaitin, G.J. (2001). How to construct self-delimiting Turing machines: the Kraft inequality. In: Exploring RANDOMNESS. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0307-3_5
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0307-3_5
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1085-9
Online ISBN: 978-1-4471-0307-3
eBook Packages: Springer Book Archive