Slides from the ASL Annual Meeting, Special Session in Computability Theory (Iowa State University, Ames, May 14-16, 2024, co-organized by Rachael Alvir and Steffen Lempp)

• Damir Dzhafarov: The Ginsburg-Sands theorem and computability theory
• David Gonzalez: Scott sentence complexities of linear orderings
• Matthew Harrison-Trainor: A return to degree spectra of relations on a cone
• Meng-Che ("Turbo") Ho: Word problems of groups as ceers
• Josiah Jacobsen-Grocott: Strong minimal pairs in the enumeration degrees
• Bjørn Kjos-Hanssen: Formal marginalia in computability theory
• Russell Miller: Computability for absolute Galois groups of computable fields
• Keng Meng ("Selwyn") Ng: Separating notions in effective topology and analysis
• Jan Reimann: Complexity notions on monoids and pointwise dimension
• Luca San Mauro: On the learning power of equivalence relations
• Isabella Scott: Constructions surrounding existentially closed groups
• Don Stull: Dimensions of pinned distance sets