hw9-sol - ECS 120 Introduction to the Theory of Computation...

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

View Full Document Right Arrow Icon
ECS 120: Introduction to the Theory of Computation Homework 9 Problem 1. In the movie The Matrix there is a TM called The Oracle which can solve problems that other TMs cannot (even some that the TM Neo couldn’t!), although, as she states herself, there are problems that are even beyond her reach. Here, we’ll try to understand why. Define Halting Oracles as regular TMs but with the added functionality of a “black box” which allows them to decide A TM = {h M,w i| w L ( M ) ,M is a TM } instanta- neously. Prove that the language O TM = {h O,w i| w L ( O ) ,O is a Halting Oracle } is not decidable by a Halting Oracle. Solution: The proof is very similar to the diagonalization proof that A TM is unde- cidable, just substitute a Halting Oracle for a TM in the original proof. This also implies that there is a hierarchy of a sort among Oracle machines (e.g. imagine a Halting Oracle with added functionality which allows it to decide O TM , etc.) Problem 2. Classify the following languages as decidable , acceptable (but not decid- able), co-acceptable (but not decidable), or neither acceptable nor co-acceptable. Prove all your answers, giving decision procedures or reductions. A.
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 note was uploaded on 04/29/2010 for the course ECS 222 taught by Professor Mr. during the Spring '10 term at UC Davis.

Page1 / 3

hw9-sol - ECS 120 Introduction to the Theory of Computation...

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