On Wed, 11 Apr 2018, Kenyon Prater wrote:
A related question, if a contact's state rests on something that is guaranteed to have a definite solution, but producing that solution computationally intractable, is there a mechanism for resolving that? It isn't paradoxical or indeterminate, it's just that we don't have the ability to determine the correct game state. (I'm reminded of the SHA-512 hash proposal)
The "reasonably" in rule 2518 might be interpreted to imply that this is already indeterminate.