Recursion Theory and Complexity: Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14-19, 1997
W. De Gruyter (1999)
AbstractThis volume contains papers from the recursion theory session of the Kazan Workshop on Recursion and Complexity Theory. Recursion theory, the study of computability, is an area of mathematical logic that has traditionally been particularly strong in the United States and the former Soviet Union. This was the first workshop ever to bring together about 50 international experts in recursion theory from the United States, the former Soviet Union and Western Europe.
Similar books and articles
Tailoring Recursion for Complexity.Erich Grädel & Yuri Gurevich - 1995 - Journal of Symbolic Logic 60 (3):952-969.
Computability, Enumerability, Unsolvability: Directions in Recursion Theory.S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) - 1996 - Cambridge University Press.
Complexity and Postmodernism: Understanding Complex Systems.Paul Cilliers - 1998 - Routledge.
Recursion Theory for Metamathematics.Raymond Merrill Smullyan - 1993 - Oxford, England: Oxford University Press.
Generalized Recursion Theory Ii: Proceedings of the 1977 Oslo Symposium.Jens Erik Fenstad, R. O. Gandy & Gerald E. Sacks (eds.) - 1978 - Sole Distributors for the U.S.A. And Canada, Elsevier North-Holland.
Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers.Piergiorgio Odifreddi - 1989 - Sole Distributors for the Usa and Canada, Elsevier Science Pub. Co..
Recursion Theory: Summer Research Institute : Papers.Anil Nerode & Richard A. Shore (eds.) - 1985 - American Mathematical Society.
Generalized Recursion Theory: Proceedings of the 1972 Oslo Symposium.Jens Erik Fenstad & Peter G. Hinman (eds.) - 1974 - New York: American Elsevier Pub. Co..
Added to PP
Historical graph of downloads
Sorry, there are not enough data points to plot this chart.