kogasa

joined 3 years ago
[–] kogasa@programming.dev 1 points 4 days ago (2 children)

Why would you do that

[–] kogasa@programming.dev 38 points 1 week ago

Official support is a higher bar than "we did the bare minimum to make sure it's theoretically possible for Proton to run it." They're probably just doing a little testing to make sure everything works decently before endorsing their product on Linux.

[–] kogasa@programming.dev 7 points 3 weeks ago

Not CPU limited, actually the opposite. It targets games where the CPU is frequently waiting for the GPU to catch up. It fixes a defect in the AMD pstate driver's active (EPP guided) mode that would cause the CPU to be treated like it's idle if it's often taking short sleeps, even if it's actually quite busy.

[–] kogasa@programming.dev 25 points 3 weeks ago

sparkling arch, sparkling fedora, and diet arch

[–] kogasa@programming.dev 3 points 4 weeks ago (1 children)

Alternating beans in one grinder willy nilly? Do you have any issues with retention?

[–] kogasa@programming.dev 1 points 4 weeks ago

Arch teaches you to exercise muscles that would otherwise atrophy. Understanding how your system is put together, how to diagnose and fix problems, how to handle upgrades safely. It becomes just as easy as any other OS and you're better off for it.

[–] kogasa@programming.dev 1 points 1 month ago

It doesn't have any. Fundamental Theorem of Arithmetic applies to integers greater than 1.

[–] kogasa@programming.dev 1 points 1 month ago (2 children)

Hence why 1 is not considered prime

[–] kogasa@programming.dev 1 points 1 month ago (4 children)

1, 11, 11*1, etc

[–] kogasa@programming.dev 3 points 1 month ago (7 children)

Gotta add context for readers.

Of all the numbers to call boring you picked the Grothendieck prime.

2 is unambiguously prime. The best motivation for the definition of primality I know is the fundamental theorem of arithmetic: every integer greater than 1 can be uniquely decomposed into a product of primes. That's what primes are, and the uniqueness constraint is why 1 is not prime.

[–] kogasa@programming.dev 6 points 1 month ago* (last edited 1 month ago)

That doesn't follow. What I think you mean is that by defining the constraints so rigorously, you've basically solved the problem yourself. But that's exactly the point. The LLM isn't the problem solver, it's the execution engine that does the wiring-up and the ticking of boxes. The easy part, arguably, sure. But still considerable effort that can be saved, and that effort may be better spent on the problem-solving + constraint-defining stage.

Mandatory disclaimer that this is not a pro-AI post. I also don't agree that this setup works, anyway. It's a classic Bob Martinism, the idea that writing good enough specifications makes the implementation irrelevant; it's the type of idea that is allergic to reality

[–] kogasa@programming.dev 16 points 1 month ago (1 children)

pis+rael sent me

view more: next ›