Back to Results
First PageMeta Content
Computability theory / Computing / Theory of computation / Halting problem / Infinite loop / Software bugs / Computer programming / Mathematics


SCOOPING THE LOOP SNOOPER A proof that the Halting Problem is undecidable Geoffrey K. Pullum School of Philosophy, Psychology and Language Sciences, University of Edinburgh No general procedure for bug checks succeeds.
Add to Reading List

Document Date: 2009-05-18 12:12:50


Open Document

File Size: 45,44 KB

Share Result on Facebook

Facility

University of Edinburgh / University of Edinburgh No / Indiana University / /

Organization

Geoffrey K. Pullum School of Philosophy / Psychology and Language Sciences / Indiana University / University of Edinburgh / University of Edinburgh No / /

Person

Alan Turing / Seuss / Geoffrey K. Pullum / Martin Davis / Philip Wadler / Larry Moss / /

PublishedMedium

Mathematics Magazine / /

SocialTag