midterm-1.1 - CSC544 Spring 2011 Midterm Take-Home Exam...

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

View Full Document Right Arrow Icon
CSC544 Spring 2011 Midterm Take-Home Exam Version 1.1 due in class Tuesday 3/29/11 Note: All work has to be your own, no team work allowed. Part A, short answers, 40 points. 1. (5 points) Why do we think of decidable language as representing algorithms? 2. (5 points) What do we mean when we say that two machines are equivalent? 3. (5 points) In your own words; describe the halting problem . 4. (5 points) In your own words describe the Church-Turing thesis. 5. (5 points) Compute the normal form of the following λ -expression, ( λx. λy. x y )( λx. x +1)3 6. (5 points) Show that the language L = { w | w has an even number of 0s, or 1s, or both } is a regular language. 7. (5 points) What do we mean when we say that the language L is not Turing-recognizable ? 8. (5 points) What does M accepts the string w mean when M is a nondeterministic automaton or Turing machine? 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
Part B, problems, 60 points. 1. (10 points) Given the language
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

midterm-1.1 - CSC544 Spring 2011 Midterm Take-Home Exam...

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