Seminar
| Parent Program: | |
|---|---|
| Location: | SLMath: Online/Virtual |
Hilbert’s Tenth Problem was the only decision problem among his twenty-three problems. Precise mathematical theory of (in)computability and its interaction with number theory led to the negative solution of the problem. The seminar will focus on modern topics on computability-theoretic phenomena in number-theoretic and other algebraic and model-theoretic structures.
To participate in this seminar, please register here: https://www.msri.org/seminars/25206
Effectiveness Aspects Of Hindmans Theorem
To participate in this seminar, please register here: https://www.msri.org/seminars/25206
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.
No Notes/Supplements UploadedEffectiveness Aspects Of Hindmans Theorem
| H.264 Video | 25185_28683_8582_Effectiveness_Aspects_of_Hindmans_Theorem.mp4 |