Another common scenario where this comes up and actually results in a great deal of confusion and misconceptions are hash maps, which are said to have a time complexity of O(1), but that does not mean that if you actually benchmark the performance of a hash map with respect to its size, that the graph will be flat or asymptotically approaches a constant value. Larger hash maps are slower to access than smaller hash maps because the O(1) isn't intended to be a claim about the overall performance of the hash map as a whole, but rather a claim about the average number of probe operations needed to lookup a value.

In fact, in the absolute purest form of time complexity analysis, where the operations involved are literally the transitions of a Turing machine, memory access is not assumed to be O(1) but rather O(n).

That's when services start to insert ads into their product.

There is now atomic_shared_ptr which is thread safe.

At any rate, for most of the HN crowd who work a fairly routine IT or an office job, 80+ hours sustained for months and months might seem impossible, but join the military, work on a ship, work on a farm, work the oil fields, work in investment banking, work in a film crew which threatened to go on strike in 2021 for having 98 hour work weeks for months on end... and you find that while it's not common, it certainly happens in various fields.

One commonly repeated piece of advice that almost all successful authors state is to write a lot, a lot, a lot. Like just practice writing, it doesn't have to be good.

I hear this often said about many other creative endeavors as well, including painting, cooking, game development/design, etc... It often seems like really good artisans just pull greatness out of thin air, but that's because we often only see the successes, not the failures, but I am reminded that even the best writers, poets, and artists in general spend a great amount of time just creating content that no one will ever see.

Companies don't need to offer severance to prevent ex employees from spilling business secrets, doing so is a criminal offense.

You can't categorically declare that something is unprovable. You can simply state that within some formal theory a proposition is independent, but you can't state that a proposition is independent of all possibly formal theories.

ZFC is not some God given axiomatic system, it just happens to be one that mathematicians in a very niche domain have settled on because almost all problems under investigation can be captured by it. Most working mathematicians don't really concern themselves with it one way or another, almost no mathematical proofs actually reference ZFC, and with respect to busy beavers, it's not at all uncommon to extend ZFC with even more powerful axioms such as large cardinality axioms in order to investigate them.

Anyhow, just want to dispel a common misconception that comes up that somehow there is a limit in principle to what the largest BB(n) is that can be computed. There are practical limits for sure, but there is no limit in principle.

The number of bugs/failures is not a meaningful metric, it's the significance of that failure that matters, and in the case of CrowdStrike that single failure was such a catastrophe that any claims they make should be scrutinized.

The fact that we can not scrutinize their claim in this instance since the details are not public makes this allegation very weak and worth being very skeptical over.