Hw9 - Homework 9  CISC 303 Timo Kötzing (tkoe@udel.edu)...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Homework 9  CISC 303 Timo Kötzing (tkoe@udel.edu) Monday, April 27. Friday, May 1. Handed out: Due Date: (8 points) Let f : N2 → N, (x, y ) → x + y (f is addition on natural numbers). Show that f is computable by explicitly giving a TM computing f . Problem 1. Problem 2. (8 points) (i) Argue informally (using the Church-Turing Thesis) that K = {code(M)|w | M TM and w ∈ L(M)} is semidecidable (K is the set of all codes of TMs, followed by a |-symbol, followed by a word accepted by that TM). (ii) Argue informally (using the Church-Turing Thesis) that L = {code(M) | M TM and L(M) = ∅} is semidecidable. Problem 3. (8 points) (i) Prove formally (ii) Prove formally languages, is that L = {code(M) | M TM and ε ∈ L(M)}, the ε-Halting that L = {code(M) | M TM and L(M) = ∅}, the decidable. not 1 Problem, is not decidable. Emptyness Problem for semi-decidable ...
View Full Document

This note was uploaded on 02/01/2012 for the course CISC 303 taught by Professor Carberry,m during the Spring '08 term at University of Delaware.

Ask a homework question - tutors are online