Here's a proof of the halting problem in verse: http://www.lel.ed.ac.uk/~gpullum/loopsnoop.html .
On Sat, Jun 23, 2012 at 11:48 AM, Devon McCormick <[email protected]> wrote: > The link says it's spelling out "Google" but I believe that is > incorrect - it looks like it's just counting up in binary. > > On Sat, Jun 23, 2012 at 10:07 AM, Donna Y <[email protected]> wrote: >> Thanks for the link. I did not watch long enough. Yes it's the code >> breaker and not an implementation of his first proof. It simply spells out >> Google. >> >> As the video asks, imagine if Alan Turing could work on one of today's >> computers to expand on any of the many problems he was pursuing! >> >> Donna >> [email protected] >> >> >> On 2012-06-23, at 7:11 AM, Brian Schott <[email protected]> wrote: >> >>> Thanks. >>> Can the working model be saved somehow? >>> Btw, I found an interesting explanation at >>> http://news.cnet.com/8301-17852_3-57459126-71/googles-impossibly-clever-alan-turing-doodle/ >>> That link suggests another purpose of the doodle. >>> >>> On Sat, Jun 23, 2012 at 1:26 AM, Donna Y <[email protected]> wrote: >>>> Its Alan Turing's birthday and that is the proof of the halting problem - >>>> see Church and Turing. >>>> >>>> Donna >>>> [email protected] >>>> >>>> >>> ---------------------------------------------------------------------- >>> For information about J forums see http://www.jsoftware.com/forums.htm >>> >> ---------------------------------------------------------------------- >> For information about J forums see http://www.jsoftware.com/forums.htm > > > > -- > Devon McCormick, CFA > ^me^ at acm. > org is my > preferred e-mail -- Devon McCormick, CFA ^me^ at acm. org is my preferred e-mail ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
