Math department seminar: Incompleteness and the universal algorithm

Title: Incompleteness and the universal algorithm

Abstract: In 1936 Alan Turing introduced a mathematical model of computation. The Turing machine has since become the standard way to formalize the notion of computability. Many incompleteness results can be recast as statements about Turing machines. For example, Kurt Gödel’s second incompleteness theorem can be equivalently stated as saying that whether certain Turing machines halt depends upon in which model of arithmetic they are ran. In this talk I will present a particularly striking instance of this phenomenon, Hugh Woodin’s universal algorithm. Woodin produced a single Turing machine which can be made to output anything so long as you run it in the right model of arithmetic.

Speaker: Kameryn J. Williams, University of Hawaiʻi at Mānoa



This talk is self-contained and does not assume any background in computability theory nor mathematical logic.

Please contact Dr. Johanna Franklin at johanna.n.franklin@hofstra.edu for the Zoom information.

Wednesday, April 21, 2021

Categories:

Location:

Zoom
Zoom Link
Online, NY 00000


Contact:

Johanna Franklin

Phone: 516-463-5739

S M T W T F S
        01 02 03
04 05 06 07 08 09 10
11 12 13 14 15 16 17
18 19 20 21 22 23 24
25 26 27 28 29 30  
english
Submit Your Hofstra Event
PARKING NOTICE

Hofstra University is pleased to have the public join us for some of our on-campus events, which are held for the benefit of our students. Please be aware, when attending events during the school year, when classes are in session, parking is often limited on South Campus to faculty and students. There is additional parking available on North Campus, approximately a 10-minute walk from Adams Playhouse, through the Student Center and over the unispan. Thank you for your cooperation.
Newest Events
Theme: