20 Credits ACADEMIC YEAR



Aims/Description: This module introduces the theoretical foundations for computing systems: finite state machines, pushdown automata, and Turing machines, along with the formal languages that can be recognised by these machine models. It also deals with the question 'What is computable?' and 'What is efficiently computable?' by showing when problems are computationally hard, and how to find algorithmic solutions to computationally hard problems.

Staff Contact: CHALERMSOOK PARINYA
Teaching Methods: Lectures, Problem solving, Independent Study
Assessment: Formal Exam, Classroom testing

Information on the department responsible for this unit (Computer Science):

Departmental Home Page
Teaching timetable

|
NOTE
The content of our courses is reviewed annually to make sure it's up-to-date and relevant. Individual modules are occasionally updated or withdrawn. This is in response to discoveries through our world-leading research; funding changes; professional accreditation requirements; student or employer feedback; outcomes of reviews; and variations in staff or student numbers. In the event of any change we'll consult and inform students in good time and take reasonable steps to minimise disruption.

URLs used in these pages are subject to year-on-year change. For this reason we recommend that you do not bookmark these pages or set them as favourites.

Teaching methods and assessment displayed on this page are indicative for 2025-26.

Western Bank, Sheffield, S10 2TN, UK