Week of Oct 24: Read NOTES on Computability Theory
Midterm Test in tutorial Oct 28: Covers NOTES pp 1 - 53.
See link at bottom of page for last year's csc 438h, including test and problem sets.
See below for solutions to Problem Set 2.
Accessibility Services needs dependable volunteer note-takers to assist
students living with a disability to achieve academic success!!
Volunteers report that by giving to the U of T community their class
attendance and note taking skills improve.
All you have to do is attend classes regularly and submit them
Step 1: Register Online as a Volunteer Note-Taker
here. Step 2: Select your course and click Register Step 3: Upload your notes after every class Typed notes can be submitted online. Legible Hand-Written notes can be scanned and uploaded at your home or at our office. Please see our office location and hours below. Accessibility Services (Note-taking Program) 455 Spadina Avenue, 4th Floor Room 400 Office Hours: 9:00 AM-4:00 PM (Monday to Friday) Daily Office closure 12:30 PM - 1:30 PM Email us at email@example.com or call 416-978-6186 if you have questions or require any assistance. Volunteers may receive co-curricular credit or a certificate of appreciation. Thank you for you support. =====================================
Chapter's I and II in Logical Foundations of Proof Complexity
by Cook and Nguyen
(available on line through the U of T library) closely follows pp 1 - 52 in the Notes.
Lectures: MW 4 in SS 2106
Tutorial: F12 in SS 2106
Tutor: Lalla Mouatadid
Stephen Cook ,
Office: Sandford Fleming 2303C, 416-978-5183
Office Hours: MW 5:15 - 6:00 Or make an appointment, or drop in.
QUESTIONS VIA EMAIL ARE WELCOME.
Text: None. See Lecture Notes below.
Reference Link: Handbook of Proof Theory, Chapters I and II by Sam Buss
Please send corrections and comments to the instructor.
Problem Sets (.pdf files)
Click here for last year's CSC 438h, including problems sets and tests.