Name: proof in alonzo church's and alan turing's mathematical logic: undecidability of first-order logic (en Inglés)
SKU: 25580184
Price: 368.98 MXN
Availability: InStock
Author: Chimakonam (Ph D), Jonathan O.
ISBN: 9781477286708

portada proof in alonzo church's and alan turing's mathematical logic: undecidability of first-order logic (en Inglés)

proof in alonzo church's and alan turing's mathematical logic: undecidability of first-order logic (en Inglés)

Formato

Libro Físico

Autor

Jonathan O. Chimakonam (Ph D)

Editorial

Authorhouse

Año

2012

Idioma

Inglés

N° páginas

166

Encuadernación

Tapa Blanda

Dimensiones

22.9x15.2x1 cm

Peso

0.25 kg.

ISBN

1477286705

ISBN13

9781477286708

Categorías

Matemáticas
Filosofía
Tecnología: cuestiones generales

proof in alonzo church's and alan turing's mathematical logic: undecidability of first-order logic (en Inglés)

Jonathan O. Chimakonam (Ph D) (Autor) · Authorhouse · Tapa Blanda

Libro Nuevo Importado

Envío: 14 a 19 días háb.

$ 737.96$ 368.98

-50%

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

Libro Nuevo

Quedan más de 100 unidades

$ 368.98

Llega entre el 22 Sep y el 30 Sep a CUAUHTÉMOC, Ciudad de México. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "proof in alonzo church's and alan turing's mathematical logic: undecidability of first-order logic (en Inglés)"

In the year 1900 the German Mathematician David Hilbert gave a curious address in Paris, at the meeting of the 2nd International Congress of Mathematicians - he titled his address "Mathematical Problems". In it, he emphasized the importance of taking on challenging problems for maintaining the progress and development of mathematics. The problems numbered 1, 2, and 10 which concern mathematical logic and which gave birth to what is called the entscheidungsproblem or the decision problem were eventually solved though in the negative by Alonzo Church and Alan Turing in their famous Church-Turing thesis. The later Turing and Gumanski's attempts are criticized as inadequate or doubtful. So the decision problem is still unsolved in the positive. This book provides a positive solution using what the author calls the General Theory of Effectively Provable Function (GEP). Tremendous insights on computer development and evolution also come to light in this research. Obviously, this book is an audacious attempt to solve a problem that has lasted for more than a century and defied the best minds of logic's greatest era!