That’s a good name for the assumption. Well, any Turing machine/computable function can be described in English (perhaps quite arduously), so consider the universal Turing machine which converts the binary description to English, and then uses that description to identify the Turing machine to simulate. This UTM certainly satisfies this assumption.
It strikes me as potentially running up against issues of NFL / self-reference.
Can you explain more? (If the above doesn’t answer it).
Another intuition I have for this assumption which doesn’t appear in the paper: English is really good language. (This is admittedly vague). In thinking about this intuition further, I’ve noticed a weaker form of Assumption 3 that would also do the trick: the assumption need only hold for ε-accurate world-models (for some ε>0). In that version of the assumption, one can use the more plausible intuitive justification: “English is a really good language for describing events arising from human-civilization in our universe.”
That’s a good name for the assumption. Well, any Turing machine/computable function can be described in English (perhaps quite arduously), so consider the universal Turing machine which converts the binary description to English, and then uses that description to identify the Turing machine to simulate. This UTM certainly satisfies this assumption.
Can you explain more? (If the above doesn’t answer it).
Another intuition I have for this assumption which doesn’t appear in the paper: English is really good language. (This is admittedly vague). In thinking about this intuition further, I’ve noticed a weaker form of Assumption 3 that would also do the trick: the assumption need only hold for ε-accurate world-models (for some ε>0). In that version of the assumption, one can use the more plausible intuitive justification: “English is a really good language for describing events arising from human-civilization in our universe.”