Logic Seminar
Matthew Harrison-Trainor
UIC
Coding information into all infinite subsets II
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.
Wednesday March 27, 2024 at 4:00 PM in 712 SEO