Contacto
Cómo comprar
Entrega
Guía de compras
Computability
Inglés
264 b
Hasta 30 días para devoluciones
Clientes que también han comprado
/
Tapa blanda
101.89
€
/
Tapa blanda
47.29
€
/
Tapa blanda
10.09
€
/
Tapa blanda
12.49
€
This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and investigate the theoretical limitations of computing. Beginning with an introduction to the mathematisation of "mechanical process" using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs. Advanced chapters cover the Ackerman function, Tarski's theorem on the non-representability of truth, Goedel's incompleteness and Rosser's incompleteness theorems, two short proofs of the incompleteness theorem that are based on Lob's deliverability conditions, Church's thesis, the second recursion theorem and applications, a provably recursive universal function for the primitive recursive functions, Oracle computations and various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees and the priority method, a thorough exposition of various versions of the first recursive theorem, Blum's complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions.
Sobre el libro
Inglés
Regale este libro hoy
Es fácil
1 Añadir al carrito y elegir Entregar como regalo en el checkout 2 Le enviaremos un vale 3 El libro llegará a la dirección del destinatarioTambién puede interesarle
/
Tapa blanda
12.49
€
/
Tapa blanda
23.29
€
¡Hola! Soy Libroamiko, tu asesor de libros.
¿Cómo puedo ayudarte?