2 ms·
You mean a deterministic state machine? Sheer number of states makes the approach less than useful. Tree recursion is often also easy to prove. Kd-tree operati
by AstralStorm 9y ago
You mean a deterministic state machine? Sheer number of states makes the approach less than useful.
Tree recursion is often also easy to prove. Kd-tree operations (incl. quadtree) are tree recursion. The only problem with it may be cache locality.
The only trouble is you have to prove you're walking the tree in one direction for correctness. To prove that in a row system rewrites some pretty interesting monads.
It greets even trickier once the recursion tree is uneven or lopsided, like in R-trees. Then you get to think about upper bounds etc.