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...
| Published in: | Communications of the ACM Vol. 54; no. 7; pp. 5 - 6 |
|---|---|
| Main Author: | |
| Format: | Article |
| Published: |
Association for Computing Machinery
Jul2011
|
| Subjects: | |
| Online Access: | View this record in EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=63023182&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 63023182 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Jul2011 vid: 54 iid: 7 pid: 68 pub: Association for Computing Machinery artinfo: ui: 63023182 10.1145/1965724.1965725 ppf: 5 ppct: 1 formats: tig: atl: Solving the Unsolvable. aug: au: Vardi, Moshe Y. su: Computer software termination Computer software Church, Alonzo Turing, Alan Mathison, 1912-1954 Cook, Byron sug: subj: Computer software termination Computer software Church, Alonzo Turing, Alan Mathison, 1912-1954 Cook, Byron ab: 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. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2011 holdings: @attributes: islocal: N |
|---|