Kogasa

“put the excess energy into batteries” is an idea, and is already pretty much what is done, but the large scale implementation still requires a lot of time, effort, and expense.

The standard .NET C# compiler and CLI run on and build for Windows, MacOS, and Linux. You can run your ASP.NET webapps in a Linux docker container, or write console apps and run them on Linux, it doesn’t matter anymore. As a .NET dev I have literally no reason to ever touch Windows, unless I’m touching legacy code from before .NET Core or building a Windows-exclusive app using a Windows app framework.

Ok, there’s no such thing as native Windows apps for Linux, but there are cross platform GUI frameworks like Avalonia and Uno that can produce apps with a polished identical experience across all platforms, no electron needed

It’s fully cross platform with .NET Core and later.

autism creature

I have heard this phrase used to describe Yippee Mans. I googled “yippee” and one of the first results was from nationalautismresourcs.com so it checks out: https://nationalautismresources.com/blog/what-is-the-yippeetbh-creature/

For an alternative that doesn’t sound insane, try turkey a la king. Turkey in a creamy sauce on puff pastry or toast.

Empty set is ∅, slashed zero is 0︀ (if your browser decides to render the unicode variant) or 0︀ in html

Learn the difference, it could save your life!

(It could not actually save your life)

She didn’t step on it, she apparently used her thumb and damaged one of the buns in the pack

Dawg you’re unhinged

It’s not the “where” specifically I’m correcting, it’s the “when.” The model is trained, then the query is run against the trained model. The query doesn’t involve any kind of internet search.

It doesn’t search the internet for cats, it is pre-trained on a large set of labelled images and learns how to predict images from labels. The fact that there are lots of cats (most of which have tails) and not many examples of things “with no tail” is pretty much why it doesn’t work, though.

No, it’s not a universal requirement nor is it particularly determined by the quality of your beans/grinder. Some very expensive grinders have anti-static mechanisms and better grinders typically have less static cling and retention. It’s also not so much about handling the grounds as it is about preventing small amounts of grounds from clinging to the inside of the grinder or your dosing cup.

Yeah, one of the key insights is that the extraction plateaus after a relatively short time and you won’t ever “over-steep” it, which is counterintuitive at least to me

Some grinders are particularly prone to static cling, my Fellow Ode v1 is terrible about it even in Florida

Measure the beans, spritz them, maybe shake them around a little to distribute the water, put in grinder. No need to wait. It should be a miniscule amount of water, you don’t want your grinder gears to rust.

If you take immortality, you also probably need to take healing. Being mortally wounded and unable to die sounds, uh, bad.

The argument describes an algorithm that can be translated into code.

1/(1-x)^(2) at 0 is 1

(1/(1-x)^(2) - 1)/x = (1 - 1 + 2x - x^(2))/x = 2 - x at 0 is 2

(1/(1-x)^(2) - 1 - 2x)/x^(2) = ((1 - 1 + 2x - x^(2) - 2x + 4x^(2) - 2x^(3))/x(2) = 3 - 2x at 0 is 3

and so on

Let f(x) = 1/((x-1)^(2)). Given an integer n, compute the nth derivative of f as f^((n))(x) = (-1)^{(n)(n+1)!/((x-1)}(n+2)), which lets us write f as the Taylor series about x=0 whose nth coefficient is f^((n))(0)/n! = (-1)^(-2)(n+1)!/n! = n+1. We now compute the nth coefficient with a simple recursion. To show this process works, we make an inductive argument: the 0th coefficient is f(0) = 1, and the nth coefficient is (f(x) - (1 + 2x + 3x^(2) + … + nx^(n-1)))/x(n) evaluated at x=0. Note that each coefficient appearing in the previous expression is an integer between 0 and n, so by inductive hypothesis we can represent it by incrementing 0 repeatedly. Unfortunately, the expression we’ve written isn’t well-defined at x=0 since we can’t divide by 0, but as we’d expect, the limit as x->0 is defined and equal to n+1 (exercise: prove this). To compute the limit, we can evaluate at a sufficiently small value of x and argue by monotonicity or squeezing that n+1 is the nearest integer. (exercise: determine an upper bound for |x| that makes this argument work and fill in the details). Finally, evaluate our expression at the appropriate value of x for each k from 1 to n, using each result to compute the next, until we are able to write each coefficient. Evaluate one more time and conclude by rounding to the value of n+1. This increments n.

I don’t think you need permission to send someone an email directly addressed to and written for them. I don’t have context for the claims about Kagi being disputed, but I’d be frustrated if someone posted a misinformed rant about my work and then refused to talk to me about it. I might even write an email. Doesn’t sound crazy. If there’s more to the “harassment” that I don’t know about, obviously I’m not in favor.

This has gotta be responsible for some awful mistreatment of alien gut fauna