# Models of Computation:  2019-2020

 Lecturer Rahul Santhanam Degrees Term Michaelmas Term 2019  (16 lectures)

## Overview

This course introduces the classical mathematical models used to analyse computation, including finite state automata, grammars, and Turing Machines.

A computer scientist should be able to distinguish between what can be computed and what cannot. This distinction can only be made with a good scientific model of computers and computation. This course introduces the powerful idea of using a mathematical model to analyse computation.

This course describes a number of different models of computation which were proposed and analysed over the past century. Many of these models were found to be equivalent, in the sense that they allow exactly the same computations to be carried out. Other models were shown to be less powerful, but simpler to implement, and so useful for some purposes.

## Synopsis

Part 1: Automata

• General introduction. Deterministic finite automata. Transition diagrams.
• Non-deterministic finite automata. The subset construction. Reduction of NFAs to DFAs.
• Regular Languages. Closure properties.
• Regular expressions.
• Compiling regular expressions into NFAs, and vice versa.
• Limits to NFAs. The Pumping Lemma. The Myhill-Nerode Theorem.
• Context-free Languages and pushdown automata.

Part 2: Turing machines and computability

• Turing's analysis of computation. The Turing machine.
• The intuitive notion of computability. Decision problems. Encoding problems as sets of strings.
• Expressive power of Turing machines. Church's thesis.
• Undecidable problems. Diagonalization. The halting problem.
• Survey of decidable and undecidable problems.
• A glimpse beyond: computatonal complexity, P=NP?
• NP-completeness

## Syllabus

The finite-state machine. Deterministic finite automata and regular languarges.

Non-deterministic finite automata, and equivalence with DFA. Closure properties of regular languages.

Regular expressions.

The pumping lemma. The Myhill-Nerode Theorem.

Context-free grammars. Pushdown automata.

The Turing machine. Church's Thesis. Decision problems and undecidability. The halting problem.