http://www.vervloesem.eu/qed/index.php/2007/04/04/bewijs-door-gedicht/ Weblog over wiskunde en computers Sat, 05 Sep 2009 15:50:53 +0000 http://wordpress.org/?v=2.6 http://www.vervloesem.eu/qed/index.php/2007/04/04/bewijs-door-gedicht/#comment-34517 How Dr. Suess would prove the halting problem undecidable Sat, 19 Jan 2008 16:10:24 +0000 http://www.vervloesem.eu/qed/?p=146#comment-34517 [...] It’s a marvelous proof, sure to liven up any undergraduate theory of computation class. But I noticed errors in the proof — not logical errors, but a transcriptional ones in the form of a mangled word, perhaps introduced by an OCR system. The third line of the fifth stanza reads “that would take and program and call P (of course!)” which has problems in syntax, semantics, rhythm and meter. I’d guess it should be “that would take any program and call P (of course!)”. Similarly, “the” in the third line in the third stanza should probably be “they”. Most of the online version I found had these errors, but I eventually found what I take to be a correct version on the QED blog. I’ve not been able to get to the original version in Mathematical Magazine to verify the correct version which I include below. [...] [...] It’s a marvelous proof, sure to liven up any undergraduate theory of computation class. But I noticed errors in the proof — not logical errors, but a transcriptional ones in the form of a mangled word, perhaps introduced by an OCR system. The third line of the fifth stanza reads “that would take and program and call P (of course!)” which has problems in syntax, semantics, rhythm and meter. I’d guess it should be “that would take any program and call P (of course!)”. Similarly, “the” in the third line in the third stanza should probably be “they”. Most of the online version I found had these errors, but I eventually found what I take to be a correct version on the QED blog. I’ve not been able to get to the original version in Mathematical Magazine to verify the correct version which I include below. [...]

]]> http://www.vervloesem.eu/qed/index.php/2007/04/04/bewijs-door-gedicht/#comment-2946 TASP - Computer Science edition « Qulog 2.0 Tue, 24 Apr 2007 14:35:02 +0000 http://www.vervloesem.eu/qed/?p=146#comment-2946 [...] TASP - Computer Science edition 24Apr07 Another TASP, another proof by contradiction. This one was found on the mathematics & computer blog QED (in Dutch). Scooping the Loop Snooper - an elementary proof of the undecidability of the halting problem [...] [...] TASP - Computer Science edition 24Apr07 Another TASP, another proof by contradiction. This one was found on the mathematics & computer blog QED (in Dutch). Scooping the Loop Snooper - an elementary proof of the undecidability of the halting problem [...]

]]>