K complexity is separable into two components, one corresponding to randomness, and the other corresponding to deterministic structure

Corresponds with how bayesian Reinforcement Learning models, the randomness component corresponds with minimizing aleatoric uncertainty while the epistemic component corresponds with minimizing epistemic uncertainty.