Revision as of 15:33, 13 July 2011 (view source) rosettacode>Markhobley m (I think this should read) ← Older edit		Revision as of 03:08, 27 August 2011 (view source) Rdm (talk \| contribs) (Proof) Newer edit →
Line 2: :This seems like less of a computing problem, and more of a discrete math problem. I'm not sure if it's a good task. --[[User:Mwn3d\|Mwn3d]] 14:45, 21 December 2007 (MST) :The task was intended to demonstrate dependent types. I've got some C++ code I'm working that demonstrates how it can be accomplished there. --[[User:Short Circuit\|Short Circuit]] 20:50, 21 December 2007 (MST) == Proof vs. Formal Verification == After reading http://t.co/8xp4fwc I decided to provide a "mathematical proof" as opposed to a meaningless formal verification. If anyone feels they should mark that solution incorrect, please first be prepared to rationally discuss the issues raised in the pdf which I have linked to here. --[[User:Rdm\|Rdm]] 03:08, 27 August 2011 (UTC) == Huh? ==

Talk:Proof (view source)