Last modified: 26 Feb 2018 19:03
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.
|Session||Second Sub Session||Credit Points||15 credits (7.5 ECTS credits)|
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.
This is the total time spent in lectures, tutorials and other class teaching.
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.