The algorithmic problem solving group conducts research into mathematical method, in particular the problem-solving skills involved in the formulation and solution of algorithmic problems. Our goal is to articulate these skills primarily by way of concrete examples, but also by the development of appropriate mathematical theory.
The demands on the reliability of computer software have, we believe, lead to massive improvements in our problem-solving skills and in mathematical method. The improvements are centred on goal-directed, calculational construction of algorithms as opposed to the traditional guess-and-verify methodology.
Of course, many algorithmic problems still pose massive challenges, and we have a very great deal to learn about good and bad technique in solving such problems. We believe, however, that the time is now ripe for a greater focus on the methodology of problem solving, rather than on specific results. Our goal is to ensure that future generations are much better problem solvers than we are, not because they know more facts but because their skills are more refined.
We aim to achieve our goals using a problem-driven approach. We intend to tackle challenging problems and document our successes and failures in solving these problems. The choice of problem is crucial. We have no intention of trying to win the jackpot by tackling famous outstanding problems; instead, we will tackle problems that we suspect are within our grasp and from which we can learn the most. (Of course, such problems may one day include some famous outstanding problems!) These may be new problems, including ones we invent ourselves in order to explore particular techniques, or old problems, where we feel there is scope for improvement of the existing method.
The group holds an informal weekly club meeting (called the “Tuesday Morning Club”). The current interests cover topics like (algorithmic) number theory, calculational mathematics and program construction. If you are interested, or would like to obtain more information, please do not hesitate to contact (one of) the current members; time and day of week vary throughout the year depending on teaching commitments.
- " href="http://aps.cs.nott.ac.uk/2012/08/28/on-euclids-algorithm-and-elementary-number-theory-2/"> On Euclid’s Algorithm and Elementary Number Theory" href="http://aps.cs.nott.ac.uk/2012/08/28/students-feedback-on-teaching-mathematics-through-the-calculational-method-2/"> Students’ Feedback on Teaching Mathematics Through The Calculational Method" href="http://aps.cs.nott.ac.uk/2010/08/17/the-algorithmics-of-solitaire-like-games/"> The Algorithmics of Solitaire-Like Games
- " href="http://aps.cs.nott.ac.uk/2010/08/17/designing-an-algorithmic-proof-of-the-two-squares-theorem/"> Designing an Algorithmic Proof of the Two-Squares Theorem" href="http://aps.cs.nott.ac.uk/2010/08/01/on-euclids-algorithm-and-elementary-number-theory/"> On Euclid’s Algorithm and Elementary Number Theory" href="http://aps.cs.nott.ac.uk/2008/08/03/recounting-the-rationals-twice-2/"> Recounting the Rationals: Twice!
The Capacity C Torch Problem
20th May 2008, from 2.00pm to 3.30pm