Logic Seminar
Matthew Harrison-Trainor
UIC
Coding information into all infinite subsets
Abstract: Given a set A, we say that A is introreducible if all subsets of A can compute A. I will talk about several results about introreducibility and the related notion where all subsets of A can compute some other set C.
Wednesday March 13, 2024 at 4:00 PM in 712 SEO