This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 154 Intro. to Automata and Complexity Theory Handout ? Autumn 2009 David Dill November 10, 2009 Challenge Problems I Here are some problems from the first part of the course for those stu- dents who are interested in something that goes beyond the homeworks. Please submit any solutions on or before the Tuesday after Thanksgiving. If I get some good solutions before then and there is demand for more, Ill create Challenge problems II. These problems are really for raising an A to an A+ grade. Im not interested in partial solutions for these or giving partial credit, although Ill give hints for people who are interested in solving them but have gotten stuck after working on them for a while. If you submit solutions, please be thorough and correct. 1. (This came up in class.) Suppose that for a given Turing machine M , there is function f ( w ) from strings to numbers, with the property that if M does not accept w within f ( w ) steps, M is not going to halt. Itis not going to halt....
View Full Document
This note was uploaded on 01/12/2010 for the course CS 154 at Stanford.