COMPX36119B (HAM)
Logic and Computation
15 Points
Staff
Lecturer(s)
Tim Stokes
4131
G.3.11
To be advised
tim.stokes@waikato.ac.nz

Administrator(s)
Librarian(s)
You can contact staff by:
 Calling +64 7 838 4466 select option 1, then enter the extension.

Extensions starting with 4, 5, 9 or 3 can also be direct dialled:
 For extensions starting with 4: dial +64 7 838 extension.
 For extensions starting with 5: dial +64 7 858 extension.
 For extensions starting with 9: dial +64 7 837 extension.
 For extensions starting with 3: dial +64 7 2620 + the last 3 digits of the extension e.g. 3123 = +64 7 262 0123.
Paper Description
This paper is about the theoretical and mathematical ideas that underlie modern computing and computational thinking.
In the first section, formal languages, machines, and models of computation are introduced and studied in some detail. Topics include: finitestate automata and regular languages; Turing machines; the ChurchTuring Thesis; the Halting Problem; formal grammars.
In the second section, we take a formal approach to propositional and especially predicate logic, including an introduction to the powerful technique of mathematical induction.
Paper Structure
The paper will be taught by Dr Tim Stokes (Mathematics).
There are three teaching hours per week, as well as some lab verification time. One of the teaching hours (usually the Thurssday) will be used as a problem session/tutorial.
All classes will be recorded using Panopto.
Learning Outcomes
Students who successfully complete the course should be able to:
Assessment
Assessment Components
The internal assessment/exam ratio (as stated in the University Calendar) is 50:50. The final exam makes up 50% of the overall mark.
Required and Recommended Readings
Required Readings
Recommended Readings
Other Resources
Online Support
Moodle is used throughout.
Workload
Linkages to Other Papers
Prerequisite(s)
Prerequisite papers: MATHS135
Restriction(s)
Restricted papers: COMP235 and COMP340