 A sub quadratic lower bound on the simulation of twotape deterministic machine by onetape probabilistic machine (Technical report. Pennsylvania State University. Dept. of Computer Science) by Balasubramanian Kalyanasundaram, 1986
 A two counter machine cannot calculate 2 (Artificial intelligence memo) by Richard Schroeppel, 1973
 Turing degree: Computer Science, Mathematical Logic, Computability Theory, Partially Ordered Set, Turing Reduction, Oracle Machine, Equivalence Relation, Equivalence Class, ManyOne Reduction
 Machines and Thought: The Legacy of Alan Turing, Volume I (Mind Association Occasional Series)
 Minds and Machines (Contemporary perspectives in philosophy) by A. M. Turing, Michael Scriven, et all 1964
 Interactive Computation: The New Paradigm
 The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science) by Thomas Thierauf, 20001002
 Unconventional Computation: 5th International Conference, UC 2006, York, UK, September 48, 2006, Proceedings (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues)
 Genetic Programming: 11th European Conference, EuroGP 2008, Naples, Italy, March 2628, 2008, Proceedings (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues)
 Membrane Computing: 10th International Workshop, WMC 2009, Curtea de Arges, Romania, August 2427, 2009. Revised Selected and Invited Papers (Lecture Notes ... Computer Science and General Issues)
 Models of Computation: An Introduction to Computability Theory (Undergraduate Topics in Computer Science) by Maribel Fernandez, 20090529
 Unleashing Janus by Ted David Harris, 20070416
 Automata and Languages: Theory and Applications by Alexander Meduna, 200008
 Computability Theory (Chapman Hall/CRC Mathematics Series) by S. Barry Cooper, 20031117
