|
|
|
|
|
|
by AdieuToLogic
225 days ago
|
|
|
There is no way to prove the correctness of non-deterministic (a.k.a. probabilistic) results for any interesting generative algorithm. All one can do is validate against a known set of tests, with the understanding that the set is unbounded over time. |
|
|