CronoDAS comments on Complexity of Value ≠ Complexity of Outcome - Less Wrong

32 Post author: Wei_Dai 30 January 2010 02:50AM

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

Comments (198)

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

Comment author: CronoDAS 01 February 2010 02:00:43AM *  4 points [-]

Joke counterexample:

x^2 = -1 is a simple problem that only has complex solutions. ;)

(Of course, that's not the meaning of "complex" that you meant.)

Serious counterexample:

The four-color theorem is relatively simple to describe, but the only known proofs are very complicated.

Comment author: wedrifid 01 February 2010 03:05:48AM 7 points [-]

Gah, don't over-qualify jokes! It's a supplicating behavior and seeking permission to be funny blunts the effect. Just throw the "X^2 = -1" out there (which is a good one by the way) and then go on to say "A more serious counterexample". That's more than enough for people to 'get it' and anyone who doesn't will just look silly.

This is the Right (Wedrifid-Laughter-Maximising) thing to do.

Comment author: CronoDAS 01 February 2010 03:56:42AM *  2 points [-]
Comment author: Zack_M_Davis 01 February 2010 04:18:00AM 2 points [-]

Was that a practical joke on wedrifid?

Comment author: CronoDAS 01 February 2010 04:28:25AM 5 points [-]
Comment author: wedrifid 01 February 2010 05:54:13AM *  1 point [-]

Nice. Die. :P

Comment author: Jordan 01 February 2010 02:10:21AM 1 point [-]

But that complicated proof could be concisely provided via a universal proof algorithm and the statement of the four color theorem.

Comment author: Peter_de_Blanc 01 February 2010 05:47:52AM 0 points [-]

Exactly! The Kolmogorov complexity is not very high.