Solving the Unsolvable.

The article discusses the notion of unsolvability in computer science. A theorem by mathematicians Alonzo Church and Alan Turing proved that no algorithm exists for checking the validity of logical formulas. A 2011 paper by Byron Cook, Andreas Podelski, and Andrey Rybalchenko describes how terminati...

Descripción completa

Detalles Bibliográficos
Publicado en:	Communications of the ACM Vol. 54; no. 7; pp. 5 - 6
Autor principal:	Vardi, Moshe Y.
Formato:	Artículo
Publicado:	Association for Computing Machinery Jul2011
Materias:	Computer software termination Computer software Church, Alonzo Turing, Alan Mathison, 1912-1954 Cook, Byron
Acceso en línea:	Ver este registro en EBSCOhost

Descripción
Sumario:	The article discusses the notion of unsolvability in computer science. A theorem by mathematicians Alonzo Church and Alan Turing proved that no algorithm exists for checking the validity of logical formulas. A 2011 paper by Byron Cook, Andreas Podelski, and Andrey Rybalchenko describes how termination for computer programs can be proved.