Information about Assignments
Overview
Information about what is expected and allowed for assignments, assignment submission, and descriptions of the assignments, are provided below.
Additional details about the assignments will be provided to students using the course’s D2L page.
General Information
Information about Academic Integrity
- Assignment Do’s and Don’t’s
- Academic Integrity: Student Handbook
- Student Success Centre’s Page for Academic Integrity
- Information from the University of Calgary Calendar
Expectations about Quality of Submitted Work
- Expectations about the Quality of Students’ Work on Assignments
- Writing Support at the University of Calgary
- A Guide to Writing Mathematics
-
Information about Typesetting Mathematical Material:
The Not So Short Introduction to LaTeX 2ε.
Note: Students are not required to typeset assignments for this course.
Assignment #1: Primitive Recursive Functions
The initial assignment tests students’ understanding of primitive recursive functions, and their ability to use the kind of recursive definition — that used to define these — to show that a given function is primitive recursive.
Another — even more limited — class of “computable” total functions is also introduced and considered in a second question. An optional bonus question gives students an early chance to develop a “hardness” result, by showing that the two classes of functions, that have now been introduced, are different.
