Peter Fletcher

Title: Lecturer - Maths
Phone: 01782 733260
Email:
Location: MacKay Building Room 2.36
Role:
Contacting me:

I was appointed as a lecturer in Computer Science and Mathematics in 1988. I have taught both computing and maths courses continuously since then. Previously I studied maths at Southampton University and then went to Bristol, where I did an MSc in mathematical logic and theory of computation, followed by a PhD in the philosophy of mathematics.

My research is divided between two fields.

  • Artificial intelligence - studying the way in which highly structured patterns can be recognised in the presence of noise.
  • Philosophy of mathematics - I am interested in different ways of understanding infinity, both in the context of pure mathematics and in the context of physical theories.

For more details, please see my home page.

I am a member of the Artificial Intelligence and Cognitive Science research group.

Selected Publications

  • LAM KP and FLETCHER P. 2009. Concurrent grammar inference machines for 2-D pattern recognition: a comparison with the level set approach. In JT. Astola, KO. Egiazarian, NM. Nasrabadi & SA. Rizvi (Eds.). Image Processing: Algorithms and Systems VII (vol. SPIE vol. 7245). SPIE-IS&T. link> doi>
  • FLETCHER P. 2007. Infinity. In Philosophy of Logic. Jacquette D (Ed.). (vol. 5). Amsterdam: Elsevier. link> full text>
  • Armstrong P and Fletcher P. 2004. Securitization in Public Sector Finance. Public Money & Management, vol. 24(3), 175-182. doi>
  • Fletcher P. 2004. Mathematical Theory of Recursive Symbol Systems. full text>
  • Fletcher P. 2003. Review of P Schuster, U Berger and H Osswald (Eds) `Reuniting the antipodes - constructive and nonstandard views of continuum' Kluwer 2001. History and Philosophy of Logic, vol. 23(4), 301-303.

Full Publications List show

Journal Articles

  • Armstrong P and Fletcher P. 2004. Securitization in Public Sector Finance. Public Money & Management, vol. 24(3), 175-182. doi>
  • Fletcher P. 2003. Review of P Schuster, U Berger and H Osswald (Eds) `Reuniting the antipodes - constructive and nonstandard views of continuum' Kluwer 2001. History and Philosophy of Logic, vol. 23(4), 301-303.
  • Fletcher P. 2002. A constructivist perspective on physics. Philosophia Mathematica (Series III), vol. 10(1), 26-42.
  • Fletcher P. 2001. Connectionist learning of regular graph grammars. CONNECTION SCIENCE, vol. 13(2), 127-188. link> doi> full text>
  • Fletcher P. 2000. The foundations of connectionist computation. CONNECTION SCIENCE, vol. 12(2), 163-196. link> doi>

Chapters

  • FLETCHER P. 2007. Infinity. In Philosophy of Logic. Jacquette D (Ed.). (vol. 5). Amsterdam: Elsevier. link> full text>

Other

  • LAM KP and FLETCHER P. 2009. Concurrent grammar inference machines for 2-D pattern recognition: a comparison with the level set approach. In JT. Astola, KO. Egiazarian, NM. Nasrabadi & SA. Rizvi (Eds.). Image Processing: Algorithms and Systems VII (vol. SPIE vol. 7245). SPIE-IS&T. link> doi>
  • Fletcher P. 2004. Mathematical Theory of Recursive Symbol Systems. full text>

MAT-20022: Metric Spaces
MAT-30006: Logic