4 ms·
The "rigorous proof" points to a Wiki page with a rambling, unrigorous explanation of a tree search.
by j2kun 5y ago
The "rigorous proof" points to a Wiki page with a rambling, unrigorous explanation of a tree search.
- svat 5y agoThe program is the proof. It's rigorous in the sense that it's an exhaustive tree search (with lower and upper bounds used for pruning), without any heuristics like "pick a word that leaves the smallest set remaining in the worst case" or anything that amounts to "let's not explore that part of the tree; hopefully there will be nothing of significance there". (Also, it's someone's blog—the author's page says "My name is Alex Selby. I am a mathematician living in Cambridge, UK"—just happens to use Mediawiki.)
- j2kun 5y agoI don't doubt the author's credentials, and the program is probably correct (I don't care enough to check). But if you write a program and tell me it does what you say it does with a high level reason why you think so, that's not a "rigorous" proof. It's a sketch of a proof.