×
×

# Show that the problem of deciding whether a specific ISBN: 9780073383095 37

## Solution for problem 66E Chapter 3.1

Discrete Mathematics and Its Applications | 7th Edition

• Textbook Solutions
• 2901 Step-by-step solutions solved by professors and subject experts
• Get 24/7 help from StudySoup virtual teaching assistants Discrete Mathematics and Its Applications | 7th Edition

4 5 0 263 Reviews
31
5
Problem 66E

Show that the problem of deciding whether a specific program with a specific input baits is solvable.

Step-by-Step Solution:

Step 1</p>

In this problem, we have to show that the given problem is solvable.

Step 2</p>

Let P be the given program with an input.

Let us write a new program Q such that if Q halts then P does not halt.

Therefore any one of them will halt.

Step 3</p>

Now let us construct another program , which uses and as the inputs. halts if any one of and halts and it prints T if halts and prints F if halts.

Step 4 of 5

Step 5 of 5

##### ISBN: 9780073383095

Unlock Textbook Solution