Coba jelasin Neal Stephenson's Cryptonomicon dari Mesin Turing dong

Turing, A., On Computable Numbers, With an Application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, Series 2, Volume 42, 1936; reprinted in M. David (ed.), The Undecidable, Hewlett, NY: Raven Press, 1965;

Boolos, G. and Jeffrey, R., Computability and Logic, 2nd ed., Cambridge: Cambridge University Press, 1980.

Rogozhin, Yurii, "A Universal Turing Machine with 22 States and 2 Symbols" , Romanian Journal Of Information Science and Technology, 1(3), 259-265, 1998. (surveys known results about small universal Turing machines)

Wolfram, Stephen, A New Kind of Science, Wolfram Media, ISBN 1-57955-008-8