You have to wonder if this part was approved by a qualified lawyer at all. A trade secret would describe proprietary knowledge of how to implement the technology, but would have no protection under patent law.
They also repeatedly claimed "DisplayLink is not a member of OIN" when it actually is, and later when they acquiesced to the cease and desist, one of the actual engineers from the company tried to review the PR to ask for changes. It's not clear anyone there has any clue what's going on!
I suspect they know that, but it reads as if they were just lazily tacking that claim on for effect. This isn't a petition to a court, this is just a demand letter. Listing out a bunch of scary damages is how demand letters often work. They don't have to go into details as to the basis of their legal claims.
Yes, but this claim is not that... It sounds like they're making an argument about trade secrets, without explicitly detailing the legal justification for it.
You definitely don't need to cite the legal justification for every demand you make in a demand letter.
You don't even need to have a valid justification to make a demand in a demand letter... it is common and normal to make arbitrary demands... they are negotiations.
Trade secrets aren't protected by law. That's why they aren't disclosed. If someone lawfully reverse engineers your trade secret, its secrecy disappears without legal recourse. Decompiling a binary for RE interop purposes is legal in the US.
Humans use heuristics such as credentials to navigate an overwhelmingly complex world. They are not infallible but they are quick enough and right enough that we reach for them instinctively.
and it's often not the right thing to do. Let's say the blog post was from a top social media influencer. Would that carry more weight for you? We should look at the content of the post more than the poster.
You seem to be confusing your quantifiers a little. (Not all SWEs must understand all CS) does not imply (there can exist parts of CS that no SWE understands).
> I think the next step is to demand that proofs either be human-scale or they prove that a human-scale proof is impossible and the machine proof is as good as it gets.
> I suspect that's possible without tripping over the halting problem. (But I can't prove it.)
I doubt that it is. For the language of proofs to be powerful enough to be able to
express an arbitrary proof it would have be Turing Complete. Proving that a proof
is the smallest proof of a given concept (i.e. there is no smaller human understandable proof)
would then be proving the minimality of a program in a Turing Complete language.
No it does not, but it does imply that if they broken system was willing to pursue one person to his death then it should fairly uphold the same standard for executives who are doing the same thing.
reply