Reading Godel’s 1946 Princeton Bicentennial Lecture

Juliette Kennedy
Professor of Mathematics
University of Helsinki

May 1, 2014, 3pm
MacQuarrie Hall 225
(Refreshments, MH210 at 2:30pm)

Abstract

In his 1946 Princeton Bicentennial Lecture Goedel suggested the problem of transferring the Turing analysis of computability to the cases of definability and provability, in particular finding a notion of definability for set theory which is “formalism free” in a sense similar to the notion of computable function — a notion which is very robust with respect to its various associated formalisms. In this lecture we examine this suggestion, as well as the developments in computability in the 1930s which set the stage for Goedel’s idea.

Learning Math and Science

by Dr. Barbara Oakley, PhD, PE

We sometimes frustrate and fool ourselves unnecessarily when trying to learn. Dr.
Oakley provides insight on how to improve learning as we watch thirteen-year-old
Magnus Carlsen successfully take on the rude, crude behavior from the world’s greatest
chess player, Gary Kasparov. Carlsen’s tricks give insight on how to excel on tests and
be more open-minded and creative in academic work and to learn math and science
more easily and with less frustration. Dr. Oakley also explains how to turn the zombies
of our neural-circuits-of-habit into friends. By avoiding willpower, we can overcome
procrastination—often one of the most troublesome challenges for both students and
instructors. This presentation is based on Dr. Oakley’s forthcoming book, A Mind for
Numbers: How to Excel in Math and Science. It features insights from many of the
world’s leading scientists, mathematicians, and engineers.

Learning Math and Science Flier (pdf)

Friday February 28, 2014

Location and Time TBA

For more information and updates go to the Department of Economics website or the SJSU Events  or email Lydia Ortega at lydia.ortega@sjsu.edu.