Last modified: 28 Jun 2018 10:27
This course provides a basic-level introduction to computability - what can and cannot be computed in principle - via the notion of a Turing Machine. The course explores concepts of infinity, recognisability, and decidability, which are crucial to computability. The course assumes some initial familiarity with a programming language along with the basics of set theory, predicate logic, and finite state machines. A functional programming language is used as a way to get 'hands on' with some of the concepts.
Study Type | Undergraduate | Level | 3 |
---|---|---|---|
Term | Second Term | Credit Points | 15 credits (7.5 ECTS credits) |
Campus | None. | Sustained Study | No |
Co-ordinators |
|
Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.
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.
Formative feedback for in-course assessments will be provided in written form. Additionally, formative feedback on performance will be provided informally during practical sessions.
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.