Last modified: 23 Jul 2024 11:06
This course provides a basic-level introduction to formal languages, mathematical models of computation, and the theory of computation. Application areas include the design of programming languages, and the recognition of fundamental limits of computation in solving problems.
| Study Type | Undergraduate | Level | 3 |
|---|---|---|---|
| Term | First Term | Credit Points | 15 credits (7.5 ECTS credits) |
| Campus | Offshore | Sustained Study | No |
| Co-ordinators |
|
||
The course includes discussion of:
• Introduction to formal languages and models of computation, for example, regular languages and finite-state automata, context-free languages and pushdown automata, Turing machines and Turing-recognizable languages.
• Key results in the theory of computation, including results about famous problems that can and cannot be solved by algorithm.
• Further topics in the theory of formal languages and computability, including application areas.
Information on contact teaching time is available from the course guide.
| Assessment Type | Summative | Weighting | 25 | |
|---|---|---|---|---|
| Assessment Weeks | Feedback Weeks | |||
| Feedback | ||||
| Knowledge Level | Thinking Skill | Outcome |
|---|---|---|
| Procedural | Apply | Students will demonstrate an understanding of, and ability to apply, formal languages and models of computation. |
| Procedural | Evaluate | To develop the ability to think analytically and creatively about key results in the theory of computation, including results about famous problems that can and cannot be solved by algorithms. |
| Procedural | Evaluate | Students will demonstrate an understanding of, and ability to apply, the theory of formal languages and computability. |
| Assessment Type | Summative | Weighting | 75 | |
|---|---|---|---|---|
| Assessment Weeks | Feedback Weeks | |||
| Feedback | ||||
| Knowledge Level | Thinking Skill | Outcome |
|---|---|---|
| Procedural | Apply | Students will demonstrate an understanding of, and ability to apply, formal languages and models of computation. |
| Procedural | Evaluate | Students will demonstrate an understanding of, and ability to apply, the theory of formal languages and computability. |
| Procedural | Evaluate | To develop the ability to think analytically and creatively about key results in the theory of computation, including results about famous problems that can and cannot be solved by algorithms. |
There are no assessments for this course.
| Assessment Type | Summative | Weighting | 100 | |
|---|---|---|---|---|
| Assessment Weeks | Feedback Weeks | |||
| Feedback | ||||
| Knowledge Level | Thinking Skill | Outcome |
|---|---|---|
|
|
||
| Knowledge Level | Thinking Skill | Outcome |
|---|---|---|
| Procedural | Apply | Students will demonstrate an understanding of, and ability to apply, formal languages and models of computation. |
| Procedural | Evaluate | To develop the ability to think analytically and creatively about key results in the theory of computation, including results about famous problems that can and cannot be solved by algorithms. |
| Procedural | Evaluate | Students will demonstrate an understanding of, and ability to apply, the theory of formal languages and computability. |
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.
