Slides from the AMS Sectional Meeting special session in Computability theory (University of Wisconsin-Milwaukee, April 20-21, 2024, co-organized by Matthew Harrison-Trainor and Steffen Lempp)

• Rachael Alvir: Scott sentences and torsion groups
• Jason Block: Elementarity of subgroups of profinite permutation groups via tree presentations
• Peter Cholak: Some Computability Theoretic Aspects of Dobrinen's result that the universal triangle free graph has finite big Ramsey degree
• Damir Dzhafarov: Non-injection principles and uniformity
• David Gonzalez: Generically computable linear orderings
• Josiah Jacobsen-Grocott: Strong minimal pairs in the enumeration degrees
• Miles Kretschmer: Infinitary logic has no expressive efficiency over finitary logic
• Patrick Lutz: A theory which really doesn't have a computable model
• Tim McNicholl: Computability theory of operator algebras
• Justin Miller: The computational strength of chip-firing games
• Russell Miller: Hilbert's Tenth Problem for generic algebraic fields
• Jan Reimann: A topological approach to selection rules and stochasticity
• Tiago Royer: Minimal degrees for coarse reducibilities
• Isabella Scott: Effective constructions of existentially closed groups (related paper)
• Reed Solomon: The tree pigeonhole principle in the Weihrauch degrees
• Don Stull: Projection theorems for small sets of directions