Unformatted text preview: New problems to be handed in: 3.1: 24, 60, plus: (A) Show that the following problem is unsolvable: given an algorithm A which is known in advance to halt on every input, to decide whether there exists an input I such A eventually outputs the symbol “1” when run with input I . 3.4: 4, 8, 22 3.5: 6, 18, 26, 34 [Hint: ﬁrst check it for at least 6 values of n ], plus: (B) In problem 26, ﬁnd all possibilities for the two integers with the given GCD and product. 3.6: 22, 24(f), 30...
View Full Document
This note was uploaded on 08/16/2010 for the course MATH 55 taught by Professor Strain during the Fall '08 term at Berkeley.
- Fall '08