Yeah, this is a really nice feature; on the couple of rare occasions where an update completely borked things I was able to go from unbootable to everything back up and running in half an hour.
Yeah, this is a really nice feature; on the couple of rare occasions where an update completely borked things I was able to go from unbootable to everything back up and running in half an hour.
I don’t know, I thought it was kind of fun that they mixed things up for a change and had the protagonist be the villain and the central plot be about his triumph over the antagonists who are the heroes; the movie ending with him relaxing and enjoying the sunset now that his great work was over and so he could retire and put down his burdens was a really nice touch.
I’d be interested in hearing what it is about the language that has gotten you so excited about it.
One of my current favorite alternative is, “X, the web app you access at twitter.com”, though given the logo that they chose I’m tempted to start referring to them as X11.
I was curious to hear what argument they were making but the article is behind a paywall. Could someone with access to it summarize for me?
I am curious because this seems a bit implausible to me given that the protocol selection process involves an open competition.
It only does not have a significant adverse effect because enough people actually do pay for the media that they are able to make a profit off of it. If no one paid for it then they would lose all of their revenue from selling copies, which would definitely be a significant adverse effect on their profits.
I mean, maybe you don’t consider that to be a problem. Maybe you think that copying media should be free and that instead of making money selling copies people should live off of the money they make from performances and/or patronage, even if this means that there is less money available to create media so in practice there is less of it around. I don’t agree with this position, but I also don’t think it is an inherently unreasonable one as long as you are being honest about it.
The point is, though, that whatever moral position you take on piracy, you cannot justify it with a claim that only holds as long as other people act differently from you.
Is the main advantage of RISC-V’s that it is a free and open standard, or does it have other inherent advantages over other RISC architectures as well?
It is hard to see how the explicit goal of not receiving updates too early is reconciled with the goal of not sacrificing security. Shouldn’t there be no such thing as “too early” when it comes to security updates?
Because that way you can use it wherever something accepts WASM. In particular, as mentioned in the linked article, Javy started its life as a way for you to submit code to Shopify Functions in JavaScript, as Shopify Functions lets you submit code as WASM so that you can program in whatever language you prefer.
No, Erlang has a completely different paradigm than Prolog, it just looks superficially similar because the people who created Erlang liked Prolog’s syntax so that’s what they used as the basis for Erlang instead of the more standard ALGOL-derived syntax that most of us are used to.
I don’t know much about Void Linux. What is it’s selling point that makes it unique?
Nah, at this point his only option is to cancel Starship and redirect all of its development funding into building a time machine so that he can dramatically increase the amount of weed he was smoking at the time he got the brilliant idea to buy Twitter so that his brain is made incapable of actually following through with it.
There are lots of possible choices of universal gate sets. However, if you are starting with Clifford gates, then it turns out to be sufficient for you to add support for a T=sqrt(S) gate; essentially T and H have the property that these two gates by themselves are sufficient to efficiently approximate any 1-qubit gate arbitrarily well (by combining these discrete rotations about the two different angles in the Bloch sphere in specific ways via the Solovay-Kitaev Theorem), and being able to perform an arbitrary 1-qubit gate and having access to an entangling 2-qubit gate (CNOT) lets you extend this to an efficient arbitrarily good approximation of any gate on an any number of qubits.
The home page for it is here. It’s based on a result known as the Gottesman-Knill Theorem which shows (constructively, i.e. providing a concrete algorithm) that quantum circuits consisting solely of Clifford gates (that is, CNOT + Hadamard + Phase, hence CHP) can be simulated efficiently classically.
Or, alternatively, since they are already making the (reasonable) compromise of working with a restricted gate set, they could expand their gate set to the Clifford group and then use the CHP algorithm to scale to much larger systems.
Cute, but the set of quantum gates is so limited that simulating them is trivial, and in particular you don’t need to sample multiple iterations to estimate the probability distribution because you already know it exactly.
So, I know that this doesn’t quite have the same nostalgia feel of the original, but there is a group of fans who have been creating free remasters of the games in the King’s Quest and Quest for Glory series.
Interesting, but are those commits to the glibc library itself or commits to the Debian package of it? The link makes it look like the latter, but I could be wrong.
Huh, is glibc really only maintained by a small number of people? I would not have expected that.
And even being understaffed and underfunded would at least be understandable, but some of these problems have been caused by the completely unnecessary upgrade of Lemmy to a non-stable branch.