Last modified: 25 Mar 2016 11:34
This course provides a basic-level introduction
to computability via the notion of a Turing Machine. Some familiarity with
imperative programming (e.g., in JAVA) and with the basics of set theory (e.g.,
the notion of a bijection) is assumed. The Functional language Haskell
(familiar from earlier courses, including CS2013) is used to explore the
concepts of infinity, recognisability and decidability, which are crucial to
computability.
Study Type | Undergraduate | Level | 3 |
---|---|---|---|
Term | Second Term | Credit Points | 15 credits (7.5 ECTS credits) |
Campus | None. | Sustained Study | No |
Co-ordinators |
|
Information on contact teaching time is available from the course guide.
1st Attempt: 1 two-hour written examination (75%); continuous assessment (25%).
Resit: 1 two-hour written examination (75%); continuous assessment mark carried forwards (25%).
Only the marks obtained on first sitting can be used for Honours classification.
During lectures, the Personal Response System and/or other ways of student interaction will be used for formative assessment. Additionally, practical sessions will provide students with practice opportunities and formative assessment.
We have detected that you are have compatibility mode enabled or are using an old version of Internet Explorer. You either need to switch off compatibility mode for this site or upgrade your browser.