Bienvenido! estás en Mandrake Libros web
Menú
Inicio / Catalogo / Hpcf3 / Computability

Carnielli, EPSTEIN
Computability
Computable Functions, Logic, and the Foundations of Mathematics
Advanced Reasoning Forum

Impresión bajo demanda. Llega en 14 dias.

Páginas: 384
Formato:
Peso: 0.582 kgs.
ISBN: 978-1-938421-48-8

The classic presentation of the theory of computable functions in the context of the foundations of mathematics. Part I motivates the study of computability with discussions and readings about the crisis in the foundations of mathematics in the early 20th century, while presenting the basic ideas of whole number, function, proof, and real number. Part II starts with readings from Turing and Post leading to the formal theory of recursive functions. Part III presents sufficient formal logic to give a full development of Gödel''s incompleteness theorems. Part IV considers the significance of the technical work with a discussion of Church''s Thesis and readings on the foundations of mathematics. This third edition contains the timeline "Computability and Undecidability" as well as the essay "On Mathematics".

Computability

$44.751,03
24 cuotas de $5.561,25
10% de descuento pagando con Transferencia o depósito bancario
Ver medios de pago
Envío gratis superando los $24.990
Computability $44.751,03
Entregas para el CP:
Cambiar CP

Medios de envío

Nuestro local

  • Mandrake Libros Rioja 1869 - Rosario- Lunes a Viernes de 10 a 19 hs. Te informaremos cuando esté listo para retirar.

    Gratis

Carnielli, EPSTEIN
Computability
Computable Functions, Logic, and the Foundations of Mathematics
Advanced Reasoning Forum

Impresión bajo demanda. Llega en 14 dias.

Páginas: 384
Formato:
Peso: 0.582 kgs.
ISBN: 978-1-938421-48-8

The classic presentation of the theory of computable functions in the context of the foundations of mathematics. Part I motivates the study of computability with discussions and readings about the crisis in the foundations of mathematics in the early 20th century, while presenting the basic ideas of whole number, function, proof, and real number. Part II starts with readings from Turing and Post leading to the formal theory of recursive functions. Part III presents sufficient formal logic to give a full development of Gödel''s incompleteness theorems. Part IV considers the significance of the technical work with a discussion of Church''s Thesis and readings on the foundations of mathematics. This third edition contains the timeline "Computability and Undecidability" as well as the essay "On Mathematics".