Two UDT1 (or UDT1.1) agents play one-shot PD. It’s common knowledge that agent A must make a decision in 10^100 ticks (computation steps), whereas agent B has 3^^^3 ticks
What does it mean when it’s said that a decision theory is running in bounded time?
I think it means the decision is being made by a machine/person/algorithm/computer, in, if not a reasonable amount of time*, then at least a finite amount of time.
*If you’re playing chess, then there’s probably a limit on how long you’re willing to wait for the other person to make a move.
What does it mean when it’s said that a decision theory is running in bounded time?
I think it means the decision is being made by a machine/person/algorithm/computer, in, if not a reasonable amount of time*, then at least a finite amount of time.
*If you’re playing chess, then there’s probably a limit on how long you’re willing to wait for the other person to make a move.