This paper analyzes regulation using algorithmic complexity, building on the regulator theorem's assertion that, under certain conditions, an optimal controller must embody a model of the system being regulated. The authors treat a closed, coupled world-regulator system as a single self-limiting program and define a "good algorithmic regulator" as one in which regulation reduces the algorithmic complexity of the world's output. They demonstrate that a larger difference in algorithmic complexity increases the likelihood of a higher amount of mutual information between the world-regulator pair, supporting the idea that the regulator "models the world" from an algorithmic information theory (AIT) perspective. Furthermore, this study suggests the existence of a canonical scalar objective and planner that are distribution-independent and applicable to individual sequences.