Could maybe use a "Catastrophic failure!" error message (experienced for real last week)
Real windows is still actually worse...
So glad I moved off Windows at home back in 2003.
4,301 karma · joined August 1, 2018
Could maybe use a "Catastrophic failure!" error message (experienced for real last week)
Real windows is still actually worse...
So glad I moved off Windows at home back in 2003.
This is why there are so many resilience initiatives in serious organisations. Assume it is gonna happen. Limit blast radius, ensure effective recovery.
I do understand the copy left rationale - to ensure the freedom to modify and for the community to benefit from those modifications, it is necessary to use the machinery of control!
OSS licenses are fully part of the copyright system and could not exist without it. Maybe you are thinking of "public domain".
I am not sure there is any limited nuclear exchange that is not so risky as to be worthless unless you just want to die.
Space based nuclear weapons do not improve your survivability. Space based nuclear missile interception might - if you could pretty much ensure you could take out the majority of your opponents missiles (star wars).
The problem there is it destabilises the Nash equilibrium of MAD and makes it more likely someone will initiate a first strike before your defensive capability is complete...
>Everyone is equal with - they all have nukes in space sitting over each other's countries waiting to drop
1. Linearity - the naive approach is quadratic on worst case data (imagine searching for 100 0's in a text of 0's).
2. Sublinearity - sublinear search algorithms skip over text that cannot match. They typically have the somewhat counter-intuitive property that they get much faster the longer the pattern is. So long patterns will be faster using a sub linear search algorithm.
Need to figure out what area they excel in - there is no one search that is the best for all types of data and pattern/search length.
One small nit: he says the naive algorithm is linear - maybe it is for the average case, but it has a quadratic worst case complexity. Bitap is linear even for worst case.
My search algorithm, HashChain [1] is a very fast sublinear algorithm, but is uses KMP (and now Bitap) to verify matches so it has a linear worst case (instead of quadratic, like Boyer Moore Horspool).
Where AI shines for me is accelerating the learning and exploration process. I can get up to speed with new tech fast. It is good at spotting issues in designs and code. It can knock out quick tests or benchmarks to support me. The quality of what I can produce with AI support is much higher than I could without it.
So it really just depends on what you use it for. If the goal is "replace humans and ship fast" that's one thing. If the goal is "explore the problem space in greater depth", it's another.
Today I had claude figure out that using SIMD would not improve performance, and it gave me an analysis of why not. So my savvy improved without having to spend days figuring that out.
Having said that, I get that using AI can also make things less fun and reduce your learning too. I guess it depends on what you use it for.
Sure, a lot of people will not take their understanding any further, but most do not have the will or the time to do so.
Even knowing mean, mode and median is not enough. You really want standard deviation too. And that is just the basics.
1. LCDM predicted hierarchical formation of large galaxies through aggregation. JWST seems to show this is not what happens (large galaxies at early times). I am sure it can be made to work, but it was not a prediction.
2. Constant Lambda - recent obervations seem to show it may be changing (OK - that is more built into the theory rather than being a prediction).
By the way, I am not saying LCDM is not massively successful. It can clearly be used to explain a lot of things. I am saying that I am not aware of many things it successfully predicted ahead of observations being made.
It has always been a minority position - but it is interesting to see a different perspective. ΛCDM is not without it's own problems. Not least that when new observations contradict it, it just gets tweaked - since we still have no idea what the CDM, if it does exist, actually is. It does not have a great predictive record; it is good at explaining obervations after the fact (the CMB notwithstanding).
I am interested to know what the measurements within the solar system are that you refer to. I had thought this was far too small a scale to prove anything about MOND or CDM.
The funeral thing isn't really a position I strongly hold; it's a pithy comment that points out science is a human endeavor and maybe not quite as objective as it is often presented.
But science as a whole is ultimately a self correcting methodology, even if it might take longer than we would want and doesnt always get it right.
Scientists are also human and will tend to defend existing ideas. In cosmology the arguments over LCDM, dark matter and dark energy have been raging for decades. Dark matter people like to say that the Bullet Cluster is incontrovertible evidence of dark matter; MOND people don't agree and point to other aspects they claim refute dark matter! It's gonna take a long time for it all to shake out.
This will first massively slow down the Horspool scan, and then once you have done all that work, you rescan it all from the start with KMP if it is doing too much.
One little fix might be to only add to the work counter and compare it outside of the main character comparison loop.
But it would be better to use the linear version of Hashchain. It also uses KMP to make it linear, but it is fully integrated and you would not need to track the work or restart scanning at all. And its a lot faster than Horspool anyway!
One little thing I spotted is you use Boyer Moore Horspool for fast literal search. This is actually not linear in the worst case, although it is almost always sublinear. Worst case would be a literal composed of the same character searching a text of the same character, where it becomes quadratic.
You can actually search strings with character classes using Horspool if you want to, and I have some enhancements to basic Horspool which could maybe help. My library, byteseek [1], implements these.
I also have a much faster algorithm, HashChain [2] which also has a guaranteed linear time version. This was published in the Symposium for Experimental Algorithmics in 2024.
I have seen less capable engineers who were more interested in management being promoted. Some engineers may interpret this as promoting incompetence, because many engineers only value engineering competence. Which is also why they don't get put in management positions.