Talk slides.

    Samuel R. Buss.
    "Large Numbers, Busy Beavers, Noncomputability and Incompleteness"
    Food for Thought seminar.

    UCSD. November 1, 2007.

    Download talk slides: PDF.                    

    Abstract: This talk surveys fundamental concepts in computability theory, including undecidability (noncomputability) and the Godel incompleteness theorems. The motivations and proof sketches are based on the Berry paradox.

Back to Sam Buss's publications page.