review3sol

# review3sol - Computer Science 340 Reasoning about...

• Homework Help
• PresidentHackerCaribou10582
• 3
• 100% (4) 4 out of 4 people found this document helpful

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

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 = { M | M is a TM and M has a useless state } . We give a reduction from E TM to U . Recall that E TM = { M | M is a TM and L ( M ) = ∅} . Given M we construct the description of a new Turing Machine M which behaves as follows on input w : M simulates M on input w . In addition, M has a special state s . M enters the state s iff the simulation of M on w accepts. We can ensure that the only possible useless state in M is s . (Note that this does not depend on whether or not M has useless states). Thus M has a useless state iff L ( M ) = . This is a reduction from E TM to U . Since E TM is undecidable, U is undecidable.

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

This is the end of the preview. Sign up to access the rest of the document.
• Fall '07
• CharikarandChazelle
• Rational number, Countable set, NP-complete, Boolean satisfiability problem, Algebraic number, MAX CUT

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern