### Two Student Lectures by TGG--TODAY

Apologies to all those who were waiting for this post! The student lectures will be today at 1:10pm in the Alan Turing Building room G205. PLEASE do attend if you are free and if you have a seminar at 2pm, that's not an excuse. People sometimes eat their lunch during a lecture, and you can always leave five minutes early. (Pretty please?)

Once again, please show your support to the two brave undergraduates and attend. The semester is winding to a close now, and I would love for The Galois Group to finish on an upbeat note. If you can't attend then you must(!) send someone in your place to sign the register of course, and to listen to the interesting talks below!

Hope to see you there in numbers...

Once again, please show your support to the two brave undergraduates and attend. The semester is winding to a close now, and I would love for The Galois Group to finish on an upbeat note. If you can't attend then you must(!) send someone in your place to sign the register of course, and to listen to the interesting talks below!

Hope to see you there in numbers...

*************************************************

Wednesday 23rd April 2008 at 1:10-2pm

Alan Turing Building, room G205

Student 1 - Geometry from Euclid to Hilbert

Abstract:

The Euclidean approach to geometric exposition, as illustrated in his Elements', predominated mathematical thinking and pedagogy for more than fifteen centuries. However, new developments in other fields, especially algebra and analysis, soon led to emergence of new

methodologies in studying geometry (geometries!). This talk will briefly survey the conceptual history of geometry up to the publication of David Hilbert's 'Foundations of Geometry'.

And

Student 2- Solving Chess

Abstract

In February 1996, a match of chess between Deep Blue, IBM's infamous chessplaying computer, and Garry Kasparov, the World Champion at the time, proved for the first time that machines are capable of beating even the strongest human. In a rematch a year later, Kasparov started

the game with an irregular opening tactic, hoping to throw off the computer so to speak. The game was drawn.

Clearly Deep Blue was not playing a perfect game. However, the question remains: Is it possible for a computer to play a perfect game of chess? Or even better, does there exist a pure strategy (i.e one that provides players with specific moves to follow at each step)? In this talk we will look at mathematicians' progress in solving chess and the attempts to create a chess-playing machine.

**************************************************

The lectures are open to anyone, and registration is not required. Please do come along, for apart from an interesting lecture, you will also have some refreshments to chomp on afterwards!

Wednesday 23rd April 2008 at 1:10-2pm

Alan Turing Building, room G205

Student 1 - Geometry from Euclid to Hilbert

Abstract:

The Euclidean approach to geometric exposition, as illustrated in his Elements', predominated mathematical thinking and pedagogy for more than fifteen centuries. However, new developments in other fields, especially algebra and analysis, soon led to emergence of new

methodologies in studying geometry (geometries!). This talk will briefly survey the conceptual history of geometry up to the publication of David Hilbert's 'Foundations of Geometry'.

And

Student 2- Solving Chess

Abstract

In February 1996, a match of chess between Deep Blue, IBM's infamous chessplaying computer, and Garry Kasparov, the World Champion at the time, proved for the first time that machines are capable of beating even the strongest human. In a rematch a year later, Kasparov started

the game with an irregular opening tactic, hoping to throw off the computer so to speak. The game was drawn.

Clearly Deep Blue was not playing a perfect game. However, the question remains: Is it possible for a computer to play a perfect game of chess? Or even better, does there exist a pure strategy (i.e one that provides players with specific moves to follow at each step)? In this talk we will look at mathematicians' progress in solving chess and the attempts to create a chess-playing machine.

**************************************************

The lectures are open to anyone, and registration is not required. Please do come along, for apart from an interesting lecture, you will also have some refreshments to chomp on afterwards!

## No comments:

Post a Comment