Computability theory and its applications : [electronic resource] 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 / Peter A. Cholak ...[et al.], editors.

Includes bibliographical references.

Randomness in computability theory / Klaus Ambos-Spies and Anton�in Ku�cera -- Open questions about the $n$-c.e. degrees / Marat Arslanov -- The theory of numberings: open problems / Serikzhan Badaev and Sergey Goncharov -- $\Pi _1^0$ classes -- structure and applications / Douglas Cenzer and Carl G. Jockusch, Jr. -- The global structure of computably enumerable sets / Peter A. Cholak -- Computability theory in arithmetic: provability, structure and techniques / C. T. Chong and Yue Yang -- How many Turing degrees are there? / Randall Dougherty and Alexander S. Kechris -- Questions in computable algebra and combinatorics / Rod Downey and J. B. Remmel -- Issues and problems in reverse mathematics / Harvey Friedman and Stephen G. Simpson -- Open problems in the theory of constructive algebraic systems / Sergey Goncharov and Bakhadyr Khoussainov -- Independence results from ZFC in computability theory: some open problems / Marcia Groszek -- Problems related to arithmetic / Julia F. Knight -- Embeddings into the computably enumerable degrees / Manuel Lerman -- Definability in the c.e. degrees: questions and results / Andr�e Nies -- Strong reducibilities, again / Piergiorgio Odifreddi -- Finitely axiomatizable theories and Lindenbaum algebras of semantic classes / Mikhail Peretyatkin -- Towards an analog of Hilbert's tenth problem for a number field / Alexandra Shlapentokh -- Natural definability in degree structures / Richard A. Shore -- Recursion theory in set theory / Theodore A. Slaman -- Extensions, automorphisms, and definability / Robert I. Soare -- Open problems in the enumeration degrees / Andrea Sorbi --

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04023

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04024

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04025

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04026

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04027

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04028

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04029

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04030

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04031

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04032

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04033

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04034

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04035

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04036

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04037

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04038

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04039

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04040

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04041

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04042

http://www.ams.org/conm/257/

http://dx.doi.org/10.1090/conm/257/04043

Access is restricted to licensed institutions

Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2012

Mode of access : World Wide Web

Description based on print version record.