CSC463S
Problem Set 1
Winter, 2015
Due: Friday, January 23, beginning of tutorial
NOTE: Each problem set counts 15% of your mark, and it is important to do your own
work. You may consult with others concerning the general approach for solving problems on
CSC463S
Problem Set 2
Winter, 2015
Due: Friday, February 13, beginning of tutorial
NOTE: Each problem set counts 15% of your mark, and it is important to do your own
work. You may consult with others concerning the general approach for solving problems on
CSC463S
Problem Set 3
Winter, 2015
Due: Friday, March 13, beginning of tutorial
NOTE: Each problem set counts 15% of your mark, and it is important to do your own
work. You may consult with others concerning the general approach for solving problems on
as
CSC 463S
Last Name
Midterm Test
February 27, 2015
First Name & Initial
Student No.
NO AIDS ALLOWED. Answer ALL questions on test paper. Use backs of sheets for scratch work.
Total Marks: 40
[10]
1. Recall that a set A is semidecidable i A = L(M ) for some
CSC 463S
Solutions to Midterm Test
February 27, 2015
NO AIDS ALLOWED. Answer ALL questions on test paper. Use backs of sheets for scratch work.
Total Marks: 40
[10]
1. Recall that a set A is semidecidable i A = L(M ) for some Turing machine M .
Recall tha
CSC 463S Winter, 2016
Computational Complexity and Computability
Instructor: S. Cook: Office SF2303C, Tel 416-978-5183, e-mail: sacook@cs.toronto.edu
Instructor office hours: MW 3:15-4:00. Or make an appointment, or drop in, or send a question via email.