Filtrar la búsqueda

  • Libros (1)

  • Nuevo (1)

a

Intervalo de precios personalizado (EUR)

a

Computability enumerability unsolvability paperback de cooper slaman (1 resultados)

Autor: 
Título: 
Refinar con la Búsqueda avanzada
  • Idioma: Inglés

    Editorial: Cambridge University Press, Cambridge, 1996

    0521557364 / 9780521557368

    Serie: Libro 199 de 387 - London Mathematical Society Lecture Notes

    • Tapa blanda
    • Impresión bajo demanda

    Librería: CitiRetail, Stevenage, Reino UnidoCitiRetail

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 96,74

    Envío por EUR 44,28 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: 1 disponible

    Paperback. Condición: new. Paperback. 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. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource for specialists and non-specialists alike. The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. This volume provides a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…