# universal machine U and Feynman's machine D

May 11th, 2015
Studypool Tutor
Price: \$10 USD

Tutor description

What is the relation between the universal machine U and Feynman's machine D?Answer| Selected Answer:| U incorporates D, but is built to tell us whether or not T halts with tape t--something it is defined to do for all machines T and tapes t.|

Word Count: 450
Showing Page: 1/3
Google1.What is the relation between the universal machine U and Feynman's machine D?Answer| Selected Answer:| U incorporates D, but is built to tell us whether or not T halts with tape t--something it is defined to do for all machines T and tapes t.||2.What does it mean to say that a function F(x) is Turing computable?Answer| Selected Answer:| A Turing machine fed a tape on which x is written will eventually halt with the result F(x) printed on the tape.||3.What does Feynman call the crucial step in the halting problem proof?Answer| Selected Answer:| Z halts when we feed it dT, if T applied to dT does not halt. But it does not halt if T applied to dTdoes halt. The crucial step: Substitute the description of Z itself for dT.||4.What is the difference between machine Z in Fig. 3.26 and Feynman's machine E in Fig. 3.25?Answer| Selected Answer:| Z scrambl

## Review from student

Studypool Student
" Excellent job "

1830 tutors are online

### Other Documents

05/11/2015

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors