Manfred comments on A Thought on Pascal's Mugging - Less Wrong

12 Post author: komponisto 10 December 2010 06:08AM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Comments (159)

You are viewing a single comment's thread. Show more comments above.

Comment author: [deleted] 10 December 2010 04:02:55PM *  1 point [-]

Why should complexity matter for Pascal's mugging?

Among other things, the ability of the mugger to communicate the threat depends on the complexity of the threat.

Comment author: Manfred 11 December 2010 04:32:11AM 0 points [-]

This isn't really the limiting reagent in the reaction, though. I can communicate all sorts of awful things (sorry, had to share - it's totally my fault if you end up reading the entire thread) much more easily than I can do them.

Comment author: komponisto 11 December 2010 05:27:59PM 1 point [-]

I can communicate all sorts of awful things much more easily than I can do them.

Not for things with values in the range of 3^^^^3 -- in such a case the difference between ability-to-communicate and ability-to-carry-out is pretty much negligible. (The complexity of an action with 3^^^^3 units of disutility is right around 3^^^^3, under my proposal.)

Comment author: Manfred 11 December 2010 11:11:29PM *  0 points [-]

Ah shoot, I read this post, and then I read SewingMachine's post, and then I realized my reply to this post was wrong.

Comment author: [deleted] 11 December 2010 11:22:57PM 2 points [-]

The Kolmogorov complexity of one bad thing repeated N times grows like log(N)

I'll repeat my other comment. log(N) is an upper bound for the complexity of N, but complexity of N can be much smaller. Complexity of 3^^^3 is tiny compared to log(3^^^3).

Comment author: Manfred 11 December 2010 11:25:40PM 0 points [-]

Oh, you totally got ninja'd.