Highlighting text with a wikpedia link is a really useful feature. I wasn't aware it existed. How did you find out about it? Is there a list of such tricks somewhere on wikipedia?
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....
Thanks for the links! A bit off topic, but Domain theory reminds me of Cuelang which manages types/values using a lattice data structure. This allows you to define configuration by progressively refining types until all values are concrete, at which point they can no longer be changed.
Good to know. Anyone using it? Are there good examples I can take a look at?
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).
5 comments
[ 3.1 ms ] story [ 16.4 ms ] threadThe 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).