{"id":1179,"date":"2009-03-03T01:49:45","date_gmt":"2009-03-03T06:49:45","guid":{"rendered":"http:\/\/onthe8spot.com\/?p=1179"},"modified":"2009-03-03T01:49:45","modified_gmt":"2009-03-03T06:49:45","slug":"scooping-the-loop-snooper-geoffrey-k-pullum","status":"publish","type":"post","link":"http:\/\/onthe8spot.com\/index.php\/2009\/03\/03\/scooping-the-loop-snooper-geoffrey-k-pullum\/","title":{"rendered":"Scooping the Loop Snooper \u2014 Geoffrey K. Pullum"},"content":{"rendered":"
\n
\n
\n
\"has<\/a><\/dt>\n
Image via Wikipedia<\/a><\/dd>\n<\/dl>\n<\/div>\n<\/div>\n

Halting Problem<\/a> in Dr Seuss<\/a> style! Quite nice! If you are unfamiliar with the halting problem read the thing and then google halting problem and click on the wikipedia link!<\/p>\n

SCOOPING THE LOOP SNOOPER
\nA proof that the Halting Problem is undecidable
\nGeoffrey K. Pullum<\/a>
\n(School of Philosophy<\/a>, Psychology and Language Sciences, University of Edinburgh<\/a>)
\nNo general procedure for bug checks succeeds.
\nNow, I won’t just assert that, I’ll show where it leads:
\nI will prove that although you might work till you drop,
\nyou cannot tell if computation<\/a> will stop.
\nScooping the Loop Snooper \u2014 Geoffrey K. Pullum<\/a>.<\/p><\/blockquote>\n

\"Reblog<\/a>