The module gives an introduction to: -
* algorithms (including computer simulations, automata and Turing machines)
* numerical methods.
The module introduces the notion of an algorithm along with examples such as computer simulations, automata, formal grammars and languages and Turing machines. We will introduce some basic numerical methods, their strengths and weaknesses, and see how we can use them to solve problems that otherwise we may not be able to tackle. We will also look at how we can implement some of these methods using an appropriate computer package.
On completion of the course students should: -
* a basic understanding of how to construct and use an algorithm, including basic computer simulations, automata, formal grammars and languages and Turing machines
* a basic understanding of numerical methods including being able to carry out simple numerical processes by hand as well as implementing and executing algorithms in an appropriate computer package.
- Module Supervisor: Edward Codling