Countable ordinals and fast-growing functions (Part 2)

Add to your list(s) Download to your calendar using vCal

• Harold Simmons (Univ. of Manchester)
• Thursday 30 November 2006, 10:00-12:00
• Computer Laboratory, Room FW11.

If you have a question about this talk, please contact Sam Staton.

As part of the three day meeting on Countable ordinals and fast growing functions I will teach

A short introduction to Ordinal Notations.

I will take a pseudo-historical approach covering

• Cantor—the problem that led him to discover (invent) ordinals
• Hardy —his attempt to index the continuum using ordinals
• Veblen—how he produced hierarchies that named larger and larger ordinals

That takes us up to 1908, when Veblen was writing. We now jump to the 1950s with

• Bachmann and Schüutte —a brief look at what they did

• Modern methods —if there is time.

I am writing a companion set of notes that will probably cover more than can be done in the talks. A draft of these can be found at

http://www.cs.man.ac.uk/~hsimmons/TEMP

as the notes

OrdNotes.pdf

These will change as I get them in better shape.

In due course I will also provide links to other relevant material.

Harold Simmons

This talk is part of the Mini Courses in Theoretical Computer Science series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• All transferable skills in the university: computing
• Cambridge talks
• Computer Laboratory, Room FW11
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• Mini Courses in Theoretical Computer Science
• Modelling Biology
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.