review3sol

review3sol - Computer Science 340 Reasoning about...

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

View Full Document Right Arrow Icon
Computer Science 340 Reasoning about Computation Review Session 3 Monday, January 14, 2008 Problem 1 An algebraic number is a complex number that is a root of a polynomial with integer coefficients. Is the set of algebraic numbers countable ? Solution: The set of polynomials with integer coefficients is countable. A polynomial of degree n can have at most n roots. Hence the set of algebraic numbers is countable. Problem 2 A useless state in a Turing Machine is one that is never entered on any input string. Consider the problem of testing whether a Turing machine has any useless states. Formulate this problem as a language and show that it is undecidable. Solution: U = {h M i| M is a TM and M has a useless state } . We give a reduction from E TM to U . Recall that E TM = {h M i| M is a TM and L ( M ) = ∅} . Given h M i we construct the description of a new Turing Machine M 0 which behaves as follows on input w : M 0 simulates M on input w . In addition, M 0 has a special state s . M 0 enters the state s iff the simulation of M on w accepts. We can ensure that the only possible useless state in M 0 is s . (Note that this does not depend on whether or not M has useless states). Thus M 0 has a useless state iff L ( M ) = . This is a reduction from E TM to U . Since E TM is undecidable, U is undecidable. Problem 3
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This homework help was uploaded on 01/29/2008 for the course COS 340 taught by Professor Charikarandchazelle during the Fall '07 term at Princeton.

Page1 / 3

review3sol - Computer Science 340 Reasoning about...

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