Of all models I like to write with Gemini the most. The language appears much more natural and elegant than what even Opus 5.5 or Astra do. Also, they give 5TB of cloud storage and discounts, it’s a steal for what you get.
Claude has particularly bad prose. Somewhat improved in 5.5, but it has historically clearly been the most annoying prose among major models because is had so many obvious tics that made it clear it was Claude rambling. Still extremely verbose.
They all ramble, they're all allergic to getting to the point. But, Gemini historically has pretty good prose. Even the self-hosted Gemma models have pretty nice, inoffensive prose. I wouldn't want to read a novel written by any of them, but I tend to ask Gemini questions in chat more often than Claude or GPT, because it has good prose and is good at using the web to research.
Agreed. It's much better at working with stuff (like documents and presentations) in other languages too. It feels like it's trained in multiple languages from the ground up rather than as an afterthought.
Qwen Flash Next has great writing! Unless it comes into any contact whatsoever with Claudeslop - then it immediately contracts the disease. It’s kind of irritating when you have it look at library code that’s been touched by Claude, because then the rest of your session is infected with it.
Same. I'm getting a surprising amount of use on the pro plan. Whereas every few hours before I'd have to take a break for an hour or two because my quota would be reached, that hasn't been happening lately.
Are you kidding/trolling? The P=NP problem is FAR more fundamental, and if proven true, would basically be a proof that e.g. public key crypto can be broken (NOT a description of how to though).
Basically, it would be a proof that all the REALLY hard (combinatorial) problems out there, have a much simpler solution, if we were able to find it.
EDIT:
NS is used daily in engineering and gas/fluid modeling. We sort of “know it works”. The smoothness proof is “just” formalizing what practitioners assume is true (very coarsely said, no intention to diminish the result!)
It’s a bit like the Collatz function IMO, empirical evidence isn’t proof, but we’ve got a huge amount of evidence for the behavior we’re trying to prove.
I believe P vs NP is a different beast entirely. We don’t even know which way the answer should go.
> and if proven true, would basically be a proof that e.g. public key crypto can be broken (NOT a description of how to though).
Well, only if the answer is that P=NP.
> I believe P vs NP is a different beast entirely. We don’t even know which way the answer should go.
Most people expect P < NP, and then crypto wouldn't be broken. P=NP would also break pseudo-random number generators, for pretty much the same reason as the rest of crypto.
However Don Knuth is one example of an expert who thinks P = NP is plausible.
Btw, we do know quite a lot about how a proof of P vs NP will _not_ look like. That is we are in the curious situation where we can prove that certain proof techniques won't work on this problem.
Weirdly enough, we already have the optimal algorithm, we just can't prove its runtime. Ie we have an algorithm that runs in polynomial time on all NP hard problems, if P=NP. (But the constant factors are crazy.)
I checked it out and total cost is too high compared to what you get in modern Mini PCs. Also, the 4800S is difficult to get and 4700S supports only SATA SSDs.
You hang out on weird hardware hacker forums and spot what people are working on. You can try buying the things multiple people are working on and getting good early results on. But most of it will end up being ewaste.