Pascal's Gift

Bongo

If Omega offered to give you 2^n utils with probability 1/n, what n would you choose?

This problem was invented by Armok from #lesswrong. Discuss.

If Omega offered to give you 2^n utils with probability 1/n, what n would you choose?

This problem was invented by Armok from #lesswrong. Discuss.

I'd spend as long as I could trying to find the highest possible n.

I've considered this problem with just n utils. Basically, pick the highest finite number you could. And consider how much you missed out on because you didn't square it.

I've considered this problem with just n utils. Basically, pick the highest finite number you could.

If in doubt write really big numbers that look kind of like "9 -> 9 -> 9 -> 9 -> 9". Is there a standard operation notation available that is more ridiculously excessive than Conway Chained Arrow? Preferably one that is easy to express rapidly in a format accepted by Omega.

I suppose I am then faced with a new problem, that of maximising the number that I can express to Omega. Do I stand there chanting Conway Chains at Om in all my wa... (read more)

13

Pascal's Gift

13

13

13

Pascal's Gift

13

13