You can stop recursing whenever you have sufficiently high confidence, which means that your algorithm terminates in finite time with probability 1, while also querying each algorithm in the infinite stack with non-zero probability.
Bingo. And combining that with a good formalization of bounded rationality tells you how deep you can afford to go.
But of course, you’re the expert, so you know that ^_^.
You can stop recursing whenever you have sufficiently high confidence, which means that your algorithm terminates in finite time with probability 1, while also querying each algorithm in the infinite stack with non-zero probability.
Bingo. And combining that with a good formalization of bounded rationality tells you how deep you can afford to go.
But of course, you’re the expert, so you know that ^_^.