6 ms·
Author here, you are both correct and not correct - in your example the two equations represent an impossible constraint (there's an evaluation loop), thus a pr
by aappleby 4y ago
Author here, you are both correct and not correct - in your example the two equations represent an impossible constraint (there's an evaluation loop), thus a program (or TLA proof) containing those two statements would be invalid.
- thwayunion 4y agoRight. That’s what I meant by imposing synaptic constraints getting you back to well trodden ground.