News for hackers. Stuff that matters.
Re:How Dr. Seuss would prove the halting problem undecidable by ryanjmo on Wednesday May 05, 2010 @03:55PM (#1322328)
Yes I am sorry, I believe I ment "it is in some ways a formal proof." It is indeed a proof sketch. With a preliminary section defining things more rigorously, I do believe that this is publishable in most of the Cryptography conferences I have published in.
Re:How Dr. Seuss would prove the halting problem undecidable by alain94040 on Wednesday May 05, 2010 @08:42PM (#1323165)
With a preliminary section defining things more rigorously I do believe that this is publishable in a conference on Cryptography

[trying to get the rhyme going for you]