Last modified: 25 Sep 2019 09:58
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 | Aberdeen | Sustained Study | No |
Co-ordinators |
|
Information on contact teaching time is available from the course guide.
Assessment Type | Summative | Weighting | 75 | |
---|---|---|---|---|
Assessment Weeks | Feedback Weeks | |||
Feedback |
Knowledge Level | Thinking Skill | Outcome |
---|---|---|
|
Assessment Type | Summative | Weighting | 25 | |
---|---|---|---|---|
Assessment Weeks | Feedback Weeks | |||
Feedback |
Formative feedback for in-course assessments will be provided in written form. Additionally, formative feedback on performance will be provided informally during practical sessions. |
Knowledge Level | Thinking Skill | Outcome |
---|---|---|
|
There are no assessments for this course.
Assessment Type | Summative | Weighting | 75 | |
---|---|---|---|---|
Assessment Weeks | Feedback Weeks | |||
Feedback |
Knowledge Level | Thinking Skill | Outcome |
---|---|---|
|
Assessment Type | Summative | Weighting | 25 | |
---|---|---|---|---|
Assessment Weeks | Feedback Weeks | |||
Feedback |
Knowledge Level | Thinking Skill | Outcome |
---|---|---|
|
Knowledge Level | Thinking Skill | Outcome |
---|---|---|
|
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.