Computability Seminar MSRI program on DDC-Effectiveness aspects of Hindman’s Theorem
Fri, 16 October, 2020
4:00pm
Computability Seminar MSRI program on DDC
Organizer: V. Harizanov
For link contact [email protected]
Friday, October 16, 12:00-1:00 ET on Zoom
Speaker: Reed Solomon, University of Connecticut
Title: Effectiveness aspects of Hindman’s Theorem
Abstract: Hindman’s Theorem says that for any coloring of the natural numbers by finitely many colors, there is an infinite set S such that all nonempty sums of distinct elements of S have the same color. Blass, Hirst and Simpson gave the first recursion theoretic analysis of this theorem. More recently, work has focused on effectiveness in bounded sum variations of this theorem. I will discuss some of these results, including joint work with Csima, Dzhafarov, Hirschfeldt, Jockusch and Westrick.