Module01-02Worksheet

Module01-02Worksheet - 7) (M2-16) For any problem, can...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Modules 1 and 2 Worksheet In Class Questions 1) (M1-7) How do we prove that something CAN be done by SOME program? 2) (M1-7) How do we prove that something CANNOT be done by ANY program? 3) (M1-7) How would Scott Adams respond to the above question? 4) (M2-5) Specify a problem about prime numbers. Input Output 5) (M2-5) Specify some other problem 6) (M2-11) Give the declaration for a program that solves your prime number problem. 7) (M2-13) How do we prove a problem CAN be solved by SOME C++ program? 8) (M2-13) How do we prove a problem CANNOT be solved by ANY C++ program?
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the 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

Page1 / 2

Module01-02Worksheet - 7) (M2-16) For any problem, can...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online