Computer Science 172 - Fall 1995 - Sinclair - Midterm 2

Computer Science 172 - Fall 1995 - Sinclair - Midterm 2 -...

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

View Full Document Right Arrow Icon
CS172Fall95Quiz2.html Quiz 2 Instructions: Please write your name at the top of this sheet. There are two questions on this quiz. Please answer each question on its own sheet of paper, using the back of the sheet to continue your answer. You may assume without proof any result that was proven in class or on a homework, provided you state it clearly. Please write clear, concise answers. If you are having problems with a part of a question, leave it and try the next one. The two questions carry approximately equal credit. 1. Consider the following problem: INSTANCE: A binary Turing machine M. QUESTION: Does M accept at least 10 strings> The above problem can be formulated as the problem of recognizing the language L >=10 = { <M> : M accepts at least 10 strings }. (Hear <M> denotes the standard encoding of a binary TM.) (a) Show that the language L >=10 is recursively enumerable (r.e.). (b) Recall that the language L halt , defined by L halt = { <M>$x : M halts on x } is not recursive. By giveng a reduction from L
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 05/17/2009 for the course CS 172 taught by Professor Seshia during the Spring '08 term at University of California, Berkeley.

Page1 / 2

Computer Science 172 - Fall 1995 - Sinclair - Midterm 2 -...

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