Computational Balloon Twisting: The Theory of Balloon Polyhedra [pdf]
cccg.ca
cccg.ca
Sort of like the formal language of the grammar as tokens to witch the probabilistic heuristic of the AI is applied in a sufficiently formal structure becomes arbitrarily close to the deterministic solution in terms of bein not non-deterministic.