One important aspect of Algorithmic Probability is that it is complete and incomputable. It is incomputable to determine this place. Like Solomonoff induction, AIXI is incomputable. Most index sets are incomputable (non-recursive) aside from two trivial exceptions. Since AIXI is incomputable (see below), it assigns zero probability to its own existence. As a necessary consequence of its completeness it is "incomputable".