A-level Computing/AQA/Paper 1/Theory of computation

==Abstraction and automation
 * Problem-solving
 * Following and writing algorithms
 * Abstraction
 * Information hiding
 * Procedural abstraction
 * Functional abstraction
 * Data abstraction
 * Problem abstraction reduction
 * Decomposition
 * Composition
 * Automation

==Regular languages
 * Regular languages
 * Finite state machines
 * Maths for regular expressions
 * Compact set notation
 * Regular expressions

==Context-free languages
 * Backus-naur form

==Classification of algorithms
 * Classification of algorithms
 * Comparing algorithms
 * Maths for big-O notation
 * Order of complexity
 * Limits of computation
 * Classification of algorithmic problems
 * Computable and non-computable problems
 * Halting problem

==A model of computation
 * Turing machine