Computability theory and its applications : current trends and open problems : proceedings of a 1999 AMS-IMS-SIAM Joint Summer Research Conference, Computability Theory and Applications, June 13-17, 1999, University of Colorado, Boulder

Randomness in computability theory by K. Ambos-Spies and A. Kucera Open questions about the $n$-c.e. degrees by M. Arslanov The theory of numberings: Open problems by S. Badaev and S. Goncharov $\mathrm{\Pi}^0_1$ classes -- Structure and applications by D. Cenzer and C. G. Jockusch, Jr. The global structure of computably enumerable sets by P. A. Cholak Computability theory in arithmetic: Provability, structure and techniques by C. T. Chong and Y. Yang How many Turing degrees are there? by R. Dougherty and A. S. Kechris Questions in computable algebra and combinatorics by R. Downey and J. B. Remmel Issues and problems in reverse mathematics by H. Friedman and S. G. Simpson Open problems in the theory of constructive algebraic systems by S. Goncharov and B. Khoussainov Independence results from ZFC in computability theory: Some open problems by M. Groszek Problems related to arithmetic by J. F. Knight Embeddings into the computably enumerable degrees by M. Lerman Definability in the c.e. degrees: Questions and results by A. Nies Strong reducibilities, again by P. Odifreddi Finitely axiomatizable theories and Lindenbaum algebras of semantic classes by M. Peretyat'kin Towards an analog of Hilbert's tenth problem for a number field by A. Shlapentokh Natural definability in degree structures by R. A. Shore Recursion theory in set theory by T. A. Slaman Extensions, automorphisms, and definability by R. I. Soare Open problems in the enumeration degrees by A. Sorbi.