Events

Filters
Export this event to calendar
iCal
RSS
RSS
Close X

Filter by:

Limit to events where the title matches:
Limit to events where the first date of the event:
Date range
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Thursday, June 18, 2026 1:30 pm - 3:00 pm EDT (GMT -04:00)

Computability Learning Seminar

Joey Lakerdas-Gayle, University of Waterloo

Sacks' Splitting Theorem on a tree

We will prove Sacks' Splitting Theorem following the method of Steffen Lempp which uses a dynamically constructed priority tree.

MC 5403

Thursday, June 25, 2026 1:30 pm - 3:00 pm EDT (GMT -04:00)

Computability Learning Seminar

Beining Mu, University of Waterloo

Thickness Lemma and Infinite Injury Priority Argument

In this talk, I will present Strong Thickness Lemma, which states that every piecewise computable c.e. set has a thick subset which lies outside of an upper cone of a non-computable c.e. set, as an example of infinite injury priority argument. In addition, I will discuss how thickness lemma implies the lack of least upper bound for infinite ascending c.e. degrees.

MC 5403