Don Dailey wrote:
in my view it's probably correct although it cannot be trusted as an absolute proof.
A practical computational problem is "solved" iff a) the underlying theory is published, b) the underlying theory is proven mathematically, c) the algorithm is published, d) the algorithm is proven mathematically, e) the used computer environment is stated, f) there is a statement that the computation has been done successfully and g) it is possible to repeat the computation independently. -- robert jasiek _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
