site banner

Culture War Roundup for the week of October 5, 2026

This weekly roundup thread is intended for all culture war posts. 'Culture war' is vaguely defined, but it basically means controversial issues that fall along set tribal lines. Arguments over culture war issues generate a lot of heat and little light, and few deeply entrenched people ever change their minds. This thread is for voicing opinions and analyzing the state of the discussion while trying to optimize for light over heat.

Optimistically, we think that engaging with people you disagree with is worth your time, and so is being nice! Pessimistically, there are many dynamics that can lead discussions on Culture War topics to become unproductive. There's a human tendency to divide along tribal lines, praising your ingroup and vilifying your outgroup - and if you think you find it easy to criticize your ingroup, then it may be that your outgroup is not who you think it is. Extremists with opposing positions can feed off each other, highlighting each other's worst points to justify their own angry rhetoric, which becomes in turn a new example of bad behavior for the other side to highlight.

We would like to avoid these negative dynamics. Accordingly, we ask that you do not use this thread for waging the Culture War. Examples of waging the Culture War:

  • Shaming.

  • Attempting to 'build consensus' or enforce ideological conformity.

  • Making sweeping generalizations to vilify a group you dislike.

  • Recruiting for a cause.

  • Posting links that could be summarized as 'Boo outgroup!' Basically, if your content is 'Can you believe what Those People did this week?' then you should either refrain from posting, or do some very patient work to contextualize and/or steel-man the relevant viewpoint.

In general, you should argue to understand, not to win. This thread is not territory to be claimed by one group or another; indeed, the aim is to have many different viewpoints represented here. Thus, we also ask that you follow some guidelines:

  • Speak plainly. Avoid sarcasm and mockery. When disagreeing with someone, state your objections explicitly.

  • Be as precise and charitable as you can. Don't paraphrase unflatteringly.

  • Don't imply that someone said something they did not say, even if you think it follows from what they said.

  • Write like everyone is reading and you want them to be included in the discussion.

On an ad hoc basis, the mods will try to compile a list of the best posts/comments from the previous week, posted in Quality Contribution threads and archived at /r/TheThread. You may nominate a comment for this list by clicking on 'report' at the bottom of the post and typing 'Actually a quality contribution' as the report reason.

2
Jump in the discussion.

No email address required.

Integer multiplication below n log n, which I had mentally filed under "the floor, go home."

If I understand your comments below, this is actually false, you didn't have any expectations about the bounds for this problem. Presumably this claim was just AI generated.

The improvement in the paper goes to n(log n)^(1-(2^-182)), which while kind of neat is essentially the same as n log n (unless we're multiplying numbers on a computer larger than the universe). It's a toy result. Your amazements suggests you probably didn't even look at the paper.

In other words, I consider your thoughts on this totally untrustworthy. Please don't use AI to write your posts.

The improvement in the paper goes to n(log n)^(1-(2^-182)), which while kind of neat is essentially the same as n log n (unless we're multiplying numbers on a computer larger than the universe). It's a toy result. Your amazements suggests you probably didn't even look at the paper.

Ahem. Please look at this comment I had left a scant few minutes back.

https://www.themotte.org/post/3960/culture-war-roundup-for-the-week/485779?context=8#context

I am well aware that this is practically indistinguishable from O(n log n). I know how exponents work. I haven't checked yet, but a sufficiently ridiculous constant factor would make it even more impractical. That's been known to happen.

If I understand your comments below, this is actually false, you didn't have any expectations about the bounds for this problem. Presumably this claim was just AI generated.

I had read mathematicians, on Twitter, expressing surprise that we went below the previous SOTA by any margin, no matter how minuscule. The model rephrased my notice of secondhand surprise into a first person version.

That is such an innocuous, irrelevant change that I wouldn't have bothered to correct it for it's own sake. I hadn't even told the model to only wrap my references in links. It was entirely at liberty to add minor context. The only reason I point it out is because I respect @2rafa, and wanted to declare it as a concrete example of a phrase I hadn't hand-typed.

In other words, I consider your thoughts on this totally untrustworthy. Please don't use AI to write your posts.

Totally untrustworthy? What a massive overreaction. A totally untrustworthy person would deny the whole thing. Instead, I'm punished for admitting any use. You're lucky I think the price of honesty is acceptable.

If you write me off, that's your problem rather than mine. Particularly since I didn't use AI to "write" my post, I had already written a post, and I threw into it for minor improvements and explicit citations I didn't have the time to source. By my standards, the changes I've quoted from the original are positive or at least benign.

If for the longest time the best exponent was some nice number like an integer or rational with small denominator, and the algorithm reaching it relatively simple, then even the tiniest improvement is notable. That it never performs better in cases small enough to be encourted in the real world, is not what mathematicians care about. Were it so, Big O notation would not be as common, and ultrafinistism would be the majority position.

I don't think I agree with that perspective on Big O notation. It's common because generally people don't intuitively understand the difference between, say, quadratic and exponential growth. But of course in computing it's crucial, so people need to be taught it over and over so that they will understand it intuitively. It has a huge impact on how fast an algorithm performs in real world implementations.

The difference here is that the smallest example where log(n)^(1-2^-182) is noticeably different is if you were multiplying two numbers whose physical representation in bits is larger than the universe. It's totally meaningless.

The best exponent was some nice number because those are easier for humans to develop proofs for.