Unformatted text preview: Theory of Computation  CSE 105
Computability Homework 3 Homework 3: The solutions to the following problems should be turned in class by July 30, 1999. 1. Let is a DFA which doesn't accept any string containing an odd number of 1s . Show that is decidable. 2. Show that is undecidable. and are Turing Machines and 3. Give an example in the spirit of the recursion theorem of a program in a real programming language (or a reasonable approximation thereof) that prints itself out. 1 8 $ 4 976%" 5 ) 3" '0" @ 6) 4 $21 0("'%#"! " ) &$ ...
View
Full Document
 Summer '99
 Paturi
 Turing Machines, real programming language, Computability Homework

Click to edit the document details