About 4-6 years earlier, depending what you want to count, although the inventors may also have been less clear on its importance or applications compared to the later public inventors.
In many of the daughter languages it does regularly include saltwater connected to the world ocean (certainly the Latin "Mare Nostrum" for the Mediterranean!); it just seems uncertain from this description whether it necessarily had that sense in PIE.
That doesn't seem like "had no ... word for ... 'sea'" is a very clear or helpful description of the situation, though.
That doesn't mean no word for sea. It means sea refers to any large body of water that you dnn't see the other side of, like in some (all?) other language families. There is no discernible distinction from the perspective of the ancient observer. The Great Lakes look like oceans. Saltiness isn't of great relevance since there are salt lakes, too.
After growing up for decades in Michigan and seeing the surrounding Great Lakes regularly, the oceans were a bit disappointing. Besides the salt. I knew it was salty but I wasn't expecting pickle juice.
There was one major distinction, which was "is it drinkable?" Someone crossing the North American Great Lakes (before pollution), didn't need to store water. But they would crossing an ocean, or the Caspian Sea. It's not like you can use seawater to irrigate most crops (except seaweed and a handful of others).
"Mere" in English doesn't seem to refer to saltwater at all. Nearly always small lakes and mostly in certain locales of eastern England.
My intuition is no, the family of cipher methods (even those that could be implemented by hand) is too open-ended, so there's no particular statistic that you could expect to see for all solvable ciphers and no unsolvable ciphers.
The definition of solving a cipher must be something like getting a highly meaningful result (like intelligible natural language text) by applying a process with relatively low Kolmogorov complexity relative to the length of the output. If you don't have a constraint like that, it could literally be meaningless what should count as a solution. For example, a cipher that was encrypted under a one-time pad can be successfully decoded to any plaintext just by choosing the appropriate key; there's no reason to prefer any plaintext over any other unless you have external knowledge that constrains the plaintext and/or the key. (That's what it means for the one-time pad to be information-theoretically secure, which is the lack of a constraint that helps distinguish a "good" solution from a "bad" solution.)
Basically you could say that every cipher is a transformation of a plaintext with some kind of computer program. (The human who invented the cipher may not have thought of it as a computer program, perhaps because computers hadn't even been invented yet, but there should be an equivalent program to the encipherment and decipherment process.) A good solution in that Kolmogorov complexity sense is like "a short program produced a meaningful decryption". There are statistical methods to recognize some kinds of plaintext, and there are statistical methods to recognize properties of specific ciphers (for example, to guess the most likely length of a Vigenère key), but it doesn't seem that this can inherently generalize across "all possible programs".
But if you want to limit the family of ciphers to specific things like Vigenère or Playfair or something, then yes, there are good statistical tests. It's just that it creates a higher-order question of how much flexibility the cipher creator could have had to choose a cipher method, conceivably including one that isn't attested anywhere, or one that has more good security properties of some kind than other classical ciphers did.
It seems like this will intersect with historical research, like "well, I don't think that so-and-so was actually sophisticated enough to literally create an interesting new kind of cipher from scratch, so therefore if this is a real message, it's probably one of these methods that would have been known in that cultural environment at that time and place", which maybe is enough of a constraint to have decent statistical tests. But we still have some idiosyncratic things like the Voynich Manuscript where experts have been fighting for decades over the baseline question of whether it's actually an enciphered human language plaintext!
The worst case problem is not even an error in encipherment but the idea that the apparent ciphertext could literally be random (chosen by throwing dice or spinning a wheel or drawing letter tiles or something), so there's no form of meaningful decipherment possible by any means, even with the original creator's knowledge.
This behavior is fairly general to Unix! A cute thing on Linux is that there are also references to open files under /proc, including synthetic kernel-generated filesystem links to the files, even if they've been deleted.
So if you delete a file from the filesystem that's open by PID 12345, you can find a reference to that file still present in /proc/12345/fd, and you can actually make a new copy of the file with cp or something.
And also when deleting a file that's on NFS, but it's reference count is non-zero in the kernel (because at least one process has it open) you end up renaming not deleting the file.
There are a lot of examples of this in the book The Secret of Our Success (which argues that human cultures have a lot of culturally-evolved knowledge which individuals would be very unlikely to develop in a single generation, and which often provides benefits for reasons that aren't consciously understood by the actual members of the culture, while occasionally including some noise or bad advice).
Many of those are traditions or ritual behaviors that decrease the chance of poisoning, sometimes subtle chronic poisoning rather than obvious acute poisoning.
Today I learned that one Space Shuttle flight (in 1985) successfully used the Abort-to-Orbit recovery plan (changing its flight path in real time in response to an engine failure during ascent). The overall mission continued, accomplished its other objectives, and was considered a success despite the engine failure.
I'm confused by this because I was involved in various distributed computing projects from about 1997 to about 2001 (as a person running compute notes for them) and from about 2001 to 2019 (as a person helping to administer a distributed computing related prize), and in the early part of that era we routinely talked about idle computer power as "wasted" because of the idea that the computer might as well be used to compute something rather than sitting idle. This may have been very credible in 1990s devices that consumed a roughly comparable amount of power regardless of what specific computation they were performing, but all modern devices have extremely variable power consumption depending on the load. You can easily feel this as devices have fans turn on or get hot when the CPU is loaded, and in many cases you can easily query the CPU with software to find out how its power consumption or clock rate or other factors get adjusted based on computational load.
This means that the idea that idle compute would have gone to waste is just no longer true on modern devices.
Now there is certainly compute that couldn't be sold to a paying cloud customer because it's too fragmented in some sense, but it still has some amount of energy cost, and, in a data center, corresponding cooling cost attributable to the marginal heat production. How can one actually say that there is literally no marginal cost at all? I just can't imagine a device that literally has the same power draw regardless of load factor!
If it's cloud compute that would be otherwise unused, the business is not paying for the electricity or wear. And they specifically put it in terms of marginal cost - Yeah there'd be an improvement from reselling this idle compute instead, but just using the cycles that would otherwise have been wasted doesn't change the status quo.
In the sense that the company paying to reserve a certain quantity of computer time isn't the owner or operator of the machines providing it, and has paid for that time by the hour, or something?
When I worked at EFF, I read a lot of news coverage (and forum discussions) of litigation, sometimes including litigation that I was working on. It was often very hard to get people to see larger context about issues like
* in the course of a court case, a judge (or multiple judges from multiple courts) are asked to make many different decisions on many different legal issues; most of those don't end or determine the outcome of the overall case
* indeed, some of the decisions are about minor issues and others are about major issues
* some of the issues presented in a case may be "questions of first impression" where no court has ever addressed them before; these are potentially very important as a matter of precedent because they might affect how similar questions are viewed in other cases
* other issues may be very longstanding or familiar ones
* lawyers may be willing to bring cases with different degrees of novelty (e.g. relying entirely on an untested theory, or not!), and with different likelihoods of success
* legal standards will often have many different elements, and one party may lose under a standard even though it met most of the elements (but not all of them)
All of these are more complex from the natural impulse to say "hooray, the court made a decision in favor of the people I think are the good guys!" or "boo, the court made a decision in favor of the people I think are the bad guys!".
I don’t like it, but you’re probably right. It is evident that many commenters have treated this story as a catastrophe that proves that the government is out to get them rather than a temporary setback for the plaintiffs and the obvious consequence of a logical overreach.
About 4-6 years earlier, depending what you want to count, although the inventors may also have been less clear on its importance or applications compared to the later public inventors.
https://en.wikipedia.org/wiki/Public-key_cryptography#Classi...
I guess that's kind of a long time in computer technology terms.
reply