Isn’t 2^{n/logn} still faster-growing than any polynomial?
- 1 Post
- 5 Comments
carmo55@lemmy.zipto
Linux@lemmy.ml•I tried CachyOS, but here's why Bazzite is still my go-to Linux gaming distro
11·16 days agoWhen i was running bazzite, I was running more apps through arch distroboxes than flatpaks, and many things i wanted to install were just straight up impossible immutably, so i switched to cachyOS and turns out, you want something, it’s on the repo or AUR and just works.
carmo55@lemmy.zipto
Linux@lemmy.ml•I tried CachyOS, but here's why Bazzite is still my go-to Linux gaming distro
3·16 days agoIt was the default terminal, yes. I also got pissed by the change, as not only does Konsole look worse than whatever it was, i had to rebind things like the terminal shortcut.
carmo55@lemmy.zipto
Linux@lemmy.ml•Just picked up a PC, curious what distro I should pick
9·2 months agoI think CachyOS is very nice - it’s as simple to setup as Bazzite for gaming but you don’t have to virtualize software that doesn’t come as a flatpak so it’s more flexible. As another commenter said, btrfs gives a really nice safety margin. The only prpblem is that Arch-based distros like Cachy should be updated quite frequently(I wouldn’t go longer than two weeks) so its not good for secondary PCs you interact with infrequently.


Yeah, i think for a general community post like this, that sentence has too much subtext (SAT is NP-complete so if it was solved in polynomial time then the title of the post would be P=NP not something about ETH).
Anyways, there could always be a hard limit at like n/logn^2 or n/logn^1.000001 or something like that.