14:00
(jt work with David Cushing and George Stagg)
Prolog is a rather unusual programming language that was developed by Alain Colmerauer 50 years ago in one of the buildings on the way to the CIRM in Luminy. It is a declarative language that operates on a paradigm of first-order logic -- as distinct from imperative languages like C, GAP and Magma. Prolog operates by loading in a list of axioms as input, and then responds at the command line to queries that ask the language to achieve particular goals, given those axioms. It gained some notoriety through IBM’s implementation of ‘Watson’, which was a system designed to play the game show Jeopardy. Through a very efficiently implemented constraint logic programming module, it is also the worlds fastest sudoku solver. However, it has had barely any serious employment by pure mathematicians. So the aim of this talk is to advertise Prolog through an extended example: my co-authors and I used it to search for new simple Lie algebras over the field GF(2) and were able to classify a certain flavour of absolutely simple Lie algebra in dimensions 15 and 31, discovering a dozen or so new examples. With some further examples in dimension 63, we then extrapolated two previously undocumented infinite families of simple Lie algebras.