There are a few typst packages for making presentation slides. Which one did you use?
wisha
Anything that’s updated with the OS can be rolled back. Now Windows is Windows so Crowdstrike handles things it’s own way. But I bet if Canonical or RedHat were to make their own versions of Crowdstrike, they would push updates through the o regular packages repo, allowing it to be rolled back.
I don’t understand your question, but are you talking about the sigmoid or arctan function?
Since this is a Rust comm, will you at least post an example using your tool with Rust?
They will upstream stuff, but sadly they are not going to mainline.
No. It uses Hallium (Android kernel, basically).
It’s already delivered - a Mastodon user got one.
But getting an OEM to make a phone under your brand is easy. The real question is how long will they keep the software maintained?
These people seem like passionate Linux enthusiasts, so one can hope.
According to the Librem people: this is Android kernel (& other low level stuff) with Debian userspace, not a true Debian phone. https://social.librem.one/@dos/112686932765355105
If I give you the entire real line except the point at zero, what will you pick? Whatever you decide on, there will always be a number closer to zero then that.
They have to get smaller to fit the problem statement- if all levers are the same size or have some nonzero minimum size then the full set of levers would be countable!
Now we play the game again 🤓. I start by removing the levers in the field/scale of view of your microscope’s default orientation.
I think one of the earliest attempts at the 4 color problem proved exactly that (that C5 graph cannot be planar). Search engines are failing me in finding the source on this though.
But any way, that result is not sufficient to proof the 4-color theorem. A graph doesn’t need to have a C5 subgraph to make it impossible to 4-color. Think of two C4 graphs. Choose one vertex from each- call them A and B. Connect A and B together. Now make a new vertex called C and connect C to every vertex except A and B. The result should be a C5-free graph that cannot be 4-colored.