<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2004-11-18 06:12:17Computer science Turing machine Models of computation Universal Turing machine Busy beaver Computability Computable function Computable number Halting problem Computability theory Theoretical computer science Theory of computation |
Add to Reading List |
jn[removed]Effective computability: Turing machines | The Quadratic Assignment Problem in Code Optimization for a Simple Universal Turing MachineDocID: 1uZDW - View Document |
| Microsoft PowerPoint - universal_machinesv2.pptDocID: 1pi6P - View Document |
| Additively efficient universal computers Daniel Dewey∗ Oxford Martin Programme on the Impacts of Future Technology, Future of Humanity InstituteDocID: 1p8Jt - View Document |
| quantum machines… for computing the universal Turing machine Alan Turing Church-TuringDocID: 1njgx - View Document |
| Logical Depth and Physical Complexity Charles H. Bennett IBM Research, Yorktown Heights NY 10598, USA ppin The Universal Turing Machine– a Half-Century Survey, edited by Rolf Herken, Oxford University Press (DocID: 1kMAF - View Document |