Computability, enumerability, unsolvability: directions in recursion theory
Éditeur :
Cambridge University Press
ISBN :
9780521557368
Date de publication :
11 janv. 1996
Dimensions :
22,8 x 15,2 x 2,1 cm
Poids :
507 g
Format :
Trade paperback (US)
Langue :
Anglais
Pays d'origine :
Grande Bretagne
The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory.