Cover Image
QR Code

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...

Full description

Published in:Communications of the ACM Vol. 54; no. 7; pp. 5 - 6
Main Author: Vardi, Moshe Y.
Format: Article
Published: Association for Computing Machinery Jul2011
Subjects:
Computer software termination
Computer software
Church, Alonzo
Turing, Alan Mathison, 1912-1954
Cook, Byron
Online Access:View this record in EBSCOhost

Internet

View this record in EBSCOhost