CPSC 513 - Xiuzhan Guo

Office Hours

After or before classes at MS 319 or by appointment at guox@cpsc.ucalgary.ca.

Lab Questions

  • Chapter 2: Page 31, Ex. 5, 6;
  • Chapter 3: Pages 43-44, Exercises 1, 2, 3, 4; Page 47, Exercises 2, 3, 5, 9;
  • Some Selected Lab Questions We Discussed October 20
  • CPSC513, TUT01, 1:00 - 1:50pm, Friday, December 1, 2006 has been moved due to some emergent, unexpected things happened.

    Please see Lecture Note for December 1, 2006.

    If there are any questions, please email me or go to my office at ICT627A. I will be very happy to discuss with you.

    We will be MS 319 and discuss Assignment 4 Questions on the next Friday (December 8, 2006).

  • Please see Pieter's Homepage for lab exercises.

    • Assignments Notes

    Do not worry about Qs 7 and 8 of Question C in Ass 2: You may assume that the 2 questions are true. Using them, you can prove Q9.

    To prove Qs 7 and 8, you may use the following equivalent definition of the boundness by Ackerman functions:

    F: N^k -> N is bounded by Ackerman functions if there is an integer M such that F(x_1,...,x_k) < A_M(max(x_1,...,x_k))

    You may want to see some papers on Turing in Notice of AMS

    Midterm Note