= 27d567bc2d48d9f40e9ccc20ea370b15)
Viliam_Bur comments on Robust Cooperation in the Prisoner's Dilemma - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (145)
The "maximum number of points" optimizing strategy maximizes the number of points in some average environment. In a sufficiently perverse environment, it will score low.
So, perhaps the question is how to define the "average" environment. Is it an environment containing bots with probability corresponding to their (Kolmogorov) complexity of code?
I was going to say that there was a program which would score more than any other program in any given environment.
But when I write that out, it's trivial to falsify.
There does not exist a strategy which is dominant in all environments.