Talk:Proof by exhaustion
|
|
I don't think that proof by exhaustion itself is controversial at all among mathematicians -- but its application or use in particular circumstances (e.g. 4-colour theorem) IS controversial. I think it's important to make this distinction clear. The logical validity of proof by exhaustion is not in doubt, but its application and veracity in concrete cases by mortal humans is another matter. Revolver
- Agreed. Specific applications of this method of proof may be controversial, but the method itself is not. Gandalf61 08:31, Nov 9, 2003 (UTC)
It may not be controversial to use but still may be seen as less valid from the point of view of understanding. It could be to do with the general mistrust of computers! skukok
Aside from that, one could mention, for example, chess problems, as a mid-range example where the proof is effectively exhaustive.
Charles Matthews 08:22, 9 Nov 2003 (UTC)
- Yes - good example - I will expand the page at some point to include this (if no-one else gets there first !). Gandalf61 08:31, Nov 9, 2003 (UTC)