Name: Tourlakis: Computability (en Inglés)
Price: 78.52 USD
Availability: InStock
Author: Tourlakis, George
ISBN: 9783030832049

portada Tourlakis: Computability (en Inglés)

Formato

Libro Físico

Editorial

Springer Verlag Gmbh

Autor

Tourlakis, George

Idioma

Inglés

N° páginas

637

Encuadernación

Tapa Blanda

ISBN13

9783030832049

Tourlakis: Computability (en Inglés)

Tourlakis, George (Autor) · Springer Verlag Gmbh · Tapa Blanda

Libro Nuevo Importado

Envío: 16 a 23 días háb.

$ 130.86$ 78.52

-40%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 78.52

Llega entre el 03 Sep y el 16 Sep a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Tourlakis: Computability (en Inglés)"

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.