SCHEDULE FOR OBERWOLFACH MEETING IN COMPUTABILITY 2012: MONDAY: 09:00 Housekeeping/Information for Participants 09:15 Jockusch: Generic Computability and Asymptotic Density BREAK 10:45 Bienvenu: The Asiomatic Power of Kolmogorov Complexity 11:30 Day: Cupping with Random Sets 12:30 LUNCH 15:00 COFFEE 16:00 Goncharov: Autostability Relative to Strong Constructivizations 16:45 Kach: Theories of Classes of Structures 17:30 Harizanov: Pi^0_1-Equivalence Structures and Their Isomorphisms 18:30 DINNER TUESDAY: 09:15 Shore: Nondefinability in the Turing degrees BREAK 10:45 Turetsky: Balancing Randomness 11:30 Lewis: The Typical Turing Degree 12:30 LUNCH 13:30 Open Problem Session (please talk to us if you want a short time slot) (J. Miller, Nies, Jockusch, Knight, Lewis, Yu) 15:00 COFFEE 16:00 Marcone: Maximal Chains in Computable Well-Partial-Orders 16:45 Towsner: Algorithmic Randomness in Ergodic Theory 17:30 Conidis: Proving that Artinian Implies Noetherian Without Proving that Artinian Implies Finite Length 18:30 DINNER WEDNESDAY: 09:15 Montalbán: Copy or Diagonalize 10:00 CONFERENCE PHOTO BREAK 10:45 Cholak: D-Maximal Sets 11:30 Brattka: Connected Subsets of Euclidean Space and the Brouwer Fixed Point Theorem 12:30 LUNCH FREE AFTERNOON THURSDAY: 09:15 Slaman: The Stable Ramsey Theorem for Pairs BREAK 10:45 Andrews: Amalgamation Constructions 11:30 Dzhafarov: Mathias Generic Sets 12:30 LUNCH 15:00 COFFEE 16:00 Wu: Isolation: Motivations and Applications 16:45 Kalimullin: Properties of Limitwise Monotonic Spectra of Sigma^0_2 Sets 17:30 Barmpalias: On the Number of Infinite Sequences with Trivial Initial Segment Complexity 18:30 DINNER FRIDAY: 09:15 Knight: An example related to a theorem of John Gregory BREAK 10:45 R. Miller: Computable Differential Fields 11:30 Stephan: Random Sets and Recursive Splittings 12:30 LUNCH 15:00 COFFEE 16:00 Kräling: Lattice Embeddings into the Computably Enumerable ibT- and cl-Degrees 16:45 Lempp: Computably Enumerable Equivalence Relations 17:30 Downey: A Hierarchy of Computably Enumerable Degrees, Unifying Classes and Natural Definability 18:30 DINNER