Printable PDF
Department of Mathematics,
Department of Mathematics,
University of California San Diego
****************************
Food for Thought Seminar
Sam Buss
UCSD
Large Numbers, Busy Beavers, Noncomputability, and Incompleteness
Abstract:
This talk surveys fundamental concepts in computability theory, including undecidability (noncomputability) and the G\"odel incompleteness theorems. The motivation and proof sketches are based on the Berry paradox."
November 1, 2007
11:00 AM
AP&M B412
****************************
