Matthew Harrison-Trainor : Coding information into all infinite subsets II

Posted by Matthew Harrison-Trainor , part of the Logic Seminar.

At

March 27, 2024, 4 p.m.

In

712 SEO

Abstract

Given a set A, we say that A is introreducible if all subsets of A can compute A. I will continue by talking about more results on introreducibility, particularly touching on uniformity and the difference between computation and enumeration.