"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature."
"Sinopsis" puede pertenecer a otra edición de este libro.
Andrea Sorbi is Associate Professor in the Department of Mathematics at the University of Siena, Italy. The author or coauthor of several key professional papers and book chapters on computability theory and mathematical logic, he is a member of the American Mathematical Society and the Association for Symbolic Logic, among other organizations. Dr. Sorbi received the Ph.D. degree (1987) in mathematics from the City University of New York, New York.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 6,00 gastos de envío desde Francia a España
Destinos, gastos y plazos de envíoLibrería: Ammareal, Morangis, Francia
Softcover. Condición: Très bon. Ancien livre de bibliothèque. Salissures sur la tranche. Pages cornées. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Stains on the edge. Dog-eared pages. Ammareal gives back up to 15% of this item's net price to charity organizations. Nº de ref. del artículo: E-595-585
Cantidad disponible: 1 disponibles
Librería: Buchpark, Trebbin, Alemania
Condición: Gut. Zustand: Gut | Sprache: Englisch | Produktart: Bücher. Nº de ref. del artículo: 1244421/203
Cantidad disponible: 1 disponibles
Librería: Chequamegon Books, Washburn, WI, Estados Unidos de America
Paperback. Condición: Very Good-. Usual library markings found throughout; Cover corners are lightly bumped/creased; library sticker on rear cover and last page; old sticker mark on spine; bumping to spine edges; old library pocket on inside rear cover. ; Part of the Lecture Notes in Pure ad Applied Mathematics series. ".exames the structural complexity theory . Resource-bounded measure and randomness.Kolmogorov complexity and inductive inference.global and local degree theory.complexity and recursion theoretic reducibilities.degree structures.algebra and topology versus logic.effective algebra and bounded arithmetic.and more." ; Ex-Library; 7 x 10"; 363 pages. Nº de ref. del artículo: 110578
Cantidad disponible: 1 disponibles