Dartmouth Logic Seminar

Schedule of talks, Winter 2007

Logic seminar will run only for the month of January as many of the logicians will be at the University of Florida at Gainesville for the months of February and March. Rebecca Weber has offered to give a series logic talks, not requiring much background in logic, to interested graduate students. Please contact her to find out more information.

TIME:	Wednesdays, 4:00pm
PLACE:	Kemeny 108

Date Speaker Title

January 10 no logic seminar

January 17 Jared Corduan
Dartmouth College Godel's Incompleteness Theorems

January 24 Rebecca Weber
Dartmouth College Randomness for closed subsets of $2^{\omega}$

January 31 no logic seminar
No seminar due to special department colloquim (job talk).

March 7 Rebecca Weber
Dartmouth College Achieving noncomputable ends by computable means.
Abstract: Is it possible to construct a noncomputable object computably? A central theme of computability (recursion) theory is working with incomplete information: a sequence of approximations guaranteed to be correct at some finite but unknown stage. This requires acting on speculation, knowing mistakes will be made, and setting up the construction so the mistakes may be overcome. We will survey some of these constructions. No logic background will be assumed.

Last Updated: March 6, 2007

Return to: Current Term

Date	Speaker	Title

January 10	no logic seminar
January 17	Jared Corduan Dartmouth College	Godel's Incompleteness Theorems
January 24	Rebecca Weber Dartmouth College	Randomness for closed subsets of $2^{\omega}$
January 31	no logic seminar	No seminar due to special department colloquim (job talk).
March 7	Rebecca Weber Dartmouth College	Achieving noncomputable ends by computable means. Abstract: Is it possible to construct a noncomputable object computably? A central theme of computability (recursion) theory is working with incomplete information: a sequence of approximations guaranteed to be correct at some finite but unknown stage. This requires acting on speculation, knowing mistakes will be made, and setting up the construction so the mistakes may be overcome. We will survey some of these constructions. No logic background will be assumed.