| || || || || || || |
2000; 320 pp; softcover
List Price: US$91
Member Price: US$72.80
Order Code: CONM/257
This collection of articles presents a snapshot of the status of computability theory at the end of the millennium and a list of fruitful directions for future research. The papers represent the works of experts in the field who were invited speakers at the AMS-IMS-SIAM Joint Summer Conference on Computability Theory and Applications held at the University of Colorado (Boulder). The conference focused on open problems in computability theory and on some related areas in which the ideas, methods, and/or results of computability theory play a role.
Some presentations are narrowly focused; others cover a wider area. Topics included from "pure" computability theory are the computably enumerable degrees (M. Lerman), the computably enumerable sets (P. Cholak, R. Soare), definability issues in the c.e. and Turing degrees (A. Nies, R. Shore) and other degree structures (M. Arslanov, S. Badaev and S. Goncharov, P. Odifreddi, A. Sorbi). The topics involving relations between computability and other areas of logic and mathematics are reverse mathematics and proof theory (D. Cenzer and C. Jockusch, C. Chong and Y. Yang, H. Friedman and S. Simpson), set theory (R. Dougherty and A. Kechris, M. Groszek, T. Slaman) and computable mathematics and model theory (K. Ambos-Spies and A. Kučera, R. Downey and J. Remmel, S. Goncharov and B. Khoussainov, J. Knight, M. Peretyat'kin, A. Shlapentokh).
Graduate students and mathematicians working in or interested in computability theory and its applications.
Table of Contents
AMS Home |
© Copyright 2014, American Mathematical Society