Anytime Algorithm
en.wikipedia.org
en.wikipedia.org
The description of anytime computing reminded me of reservoir computing, but not for any specific reason, so here's a link with a highlight to reservoir computing: https://en.wikipedia.org/wiki/Reservoir_computing#:~:text=Re....
Another association is with Scott continuity from denotational semantics where algorithms are modeled as continuous functions on Scott domains. Like with anytime computing continuous functions converge gradually to their output: https://en.wikipedia.org/wiki/Domain_theory#:~:text=Domain%2....
Note for admins and Dan G. (dang), highlighting would be very useful for HN as well.
The Logic of CUE: https://cuelang.org/docs/concepts/logic/
Your comparison makes sense after I looked at the CUE docs. The explanation for booleans is exactly how it's modeled as a domain, it is isomorphic to the lattice of subsets of the 2 element set with true and false. Domains and lattices are closely related, I think there might even be a duality theorem that says they're equivalent (probably Stone duality but I'm not sure).