hw10 - Benjamin P. Horstman EECS 343 HW 10 2007­05­03...

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

View Full Document Right Arrow Icon
Benjamin P. Horstman EECS 343 HW 10 2007-05-03 ME106) No.  Reduce from HP: Create M' s.t. M' accepts iff a non-blank symbol would be written by M. Create new TM N on input x. Simulate  M' on y using N. M ~halt  N accept nothing M halt N writes at least one non-blank letter ME107) Consider TM N which accepts  rev  L(M). If L(N) =  * then we would have to decide if L(M) = * This is undecidable per our proof in class. ME117) a) let L(M) =  * Then you would have to decide whether L(N) =  *, which is undecideable. b) Since this isn't a proper subset, the above case is included here, making this undecidable also.
Background image of page 1

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

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

Page1 / 2

hw10 - Benjamin P. Horstman EECS 343 HW 10 2007­05­03...

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