Abstract
Okay, so now we’ve got a fairly simple version of LISP. Its interpreter is only three hundred lines of Mathematica code, and it’s less than a thousand lines C and Java. So let’s use it!
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 program my universal Turing machine in LISP. In: Exploring RANDOMNESS. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0307-3_3
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0307-3_3
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1085-9
Online ISBN: 978-1-4471-0307-3
eBook Packages: Springer Book Archive