This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 7) (M2-16) For any problem, can there be more than one program that solves it? 8) (M2-16) For any program, can it solve more than one problem? 9) (M2-16) Which task is harder: proving a problem is solvable or unsolvable? Take home review questions 1) What is a problem? 2) How do we specify a problem? 3) What is our modified version of the Church-Turing Thesis? 4) What is the significance of the Church-Turing Thesis?...
View Full Document
- Fall '07