Talk:Proof: Difference between revisions
→Clarification needed: new section
m (→Proofs: formatting) |
(→Clarification needed: new section) |
||
Line 13:
Does this task apply to languages which are not built as theorem-proving systems? If so, what constitutes an acceptable implementation of "prove that the addition of any two even numbers is even"? --[[User:Kevin Reid|Kevin Reid]] 00:07, 17 February 2009 (UTC)
== Clarification needed ==
The first line of the description reads: <cite>"Define a type for a sub-set of natural numbers (0, 1, 2, 3, ...) representable by a computer, and addition on them."</cite> Can somebody please clarify that last phrase, <cite>"addition on them"</cite>? I ''think'' I know what it's supposed to mean (and I'm ''fairly'' sure I understand the task as a whole) but just in case... -- [[User:Eriksiers|Eriksiers]] 22:24, 5 November 2009 (UTC)
| |||