= 27d567bc2d48d9f40e9ccc20ea370b15)
Nisan comments on Fine-tuned for Interestingness vs. Ramsey's Theorem - 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 (18)
Oh, your definition of interestingness is kinda sorta the opposite of what I thought it was. "Having a monochromatic complete subgraph of a certain size" is not a distinguishing feature of sufficiently large colored complete graphs, because all such graphs have that property.