Universal Turing Machines cs通用图图.virginia.pptVIP

Lecture 27: Universal Turing Machines David Evans /evans Turing Machine (1936) Describing Finite State Machines Example Turing Machine Enumerating Turing Machines Now that we’ve decided how to describe Turing Machines, we can number them TM-5023582376 = balancing parens TM = even number of 1s TM-3523796834721038296738259873 = Photomosaic Program TM-3672349872381692309875823987609823712347823 = WindowsXP Universal Turing Machine Yes! People have designed Universal Turing Machines with 4 symbols, 7 states (Marvin Minsky) 4 symbols, 5 states 2 symbols, 22 states 18 symbols, 2 states 2 states, 5 symbols (Stephen Wolfram) No one knows what the smallest possible UTM is Church-Turing Thesis Any mechanical computation can be performed by a Turing Machine There is a TM-n corresponding to every decidable problem We can simulate one step on any “normal” (classical mechanics) computer with a constant number of steps on a TM: If a problem is in P on a TM, it is in P on an iMac, CM5, Cray, Palm, etc. But maybe not a quantum computer! (later class) Universal Language Is Scheme as powerful as a Universal Turing Machine? Is a Universal Turing Machine as powerful as Scheme? Complexity in Scheme Special Forms if, cond, define, etc. Primitives Numbers (infinitely many) Booleans: #t, #f Functions (+, -, and, or, etc.) Evaluation Complexity Environments (more than ? of our eval code) ?-calculus Alonzo Church, 1940 (LISP was developed from ?-calculus, not the other way round.) term = variable | term term | (term) | ? variable . term What is Calculus? In High School: d/dx xn = nxn-1 [Power Rule] d/dx (f + g) = d/dx f + d/dx g [Sum Rule] Calculus is a branch of mathematics that deals with limits and the differentiation and integration of functions of one or more variables... Real Definition A calculus is just a bunch of rules for manipulating symbols. People can give meaning to those symbols, but that’s not p