| MATH 435 |
CRN 7676, 15 Points (2009 1/3) |
| Coordinator: |
Dr George Barmpalias
|
| Recommended Reading: |
Carl Smith, A Recursive Introduction to the Theory of Computation.Garey and Johson, Computers and Intractability.Hartley Rogers, Jr, Theory of Recursive Functions and Effective Computability.R.I. Soare, Recursively Enumerable Sets and Degrees. |
| Description: |
This is a course about the algorithmic content of mathematics. That is, the part of mathematics that could be, theoretically at least, performed upon a machine.
It will build on the foundation of MATH 309, although it could be attempted by students with alternative suitable backgrounds. It is about the underlying mathematics of algorithms and hence the mathematical ideas behind the discipline of computer science. Structural complexity and computation are studied at a more advanced level. Some study of the theory of distributed systems may be included.
|
|
|
