12:00 pm Friday, December 2, 2005
Sophex: Undecidability in Mathematics by Sean Bowman in RLM 9.166
At the beginning of the 20th century, some mathematicians hoped that math could be axiomatized and mechanized. Godel's incompleteness theorem made these people cry. As aspiring mathematicians at the beginning of the 21st century, we should get to know and love undecidability. In this talk, we'll discuss what it means for a problem to be undecidable and explore some undecidable problems in geometry, algebra, topology, analysis, and number theory. Submitted by
|
|