Kogasa

I dunno if you’re joking, but yeah there’s IDE plugins that do this. GitHub Copilot grabs context from files in your edit history and you can tell it to edit, refactor, “fix” etc. selections. The more complex actions, the less likely to succeed, though.

Everything changed when they removed ham from the menu

“Don’t mention the war”

The direct connection is cool, I just wonder if a P2P connection is actually any better than going through a data center. There’s gonna be intermediate servers right?

Do you need to have Tailscale set up on any network you want to use this on? Because I’m a fan of being able to just throw my domain or IP into any TV and log in

I just use nginx on a tiny Hetzner vps acting as a reverse proxy for my home server. I dunno what the point of Tailscale is here, maybe better latency and fewer network hops in some cases if a p2p connection is possible? But I’ve never had any bandwidth or latency issues doing this

It gets around port forwarding/firewall issues that most people don’t know how to deal with. But putting it behind a paywall kinda kills any chance of it being a benevolent feature.

It’s got a very high barrier to entry. You kinda have to suffer through it for a while before you get it. And then you unlock a totally different kind of suffering.

Algebras have two operations by definition and the one thing they have in common is that the multiplication distributes over addition.

Yes, there is no notion of inverses without an identity, the definition of an inverse is in terms of an identity.

Stop posting.

As long as we can put an upper bound on gayness (or more specifically on each totally ordered subset of people under the is-gayer-than relation) this follows from Zorn’s lemma.

It’s also true by virtue of the fact that the set of all people who will have ever lived is finite, but “the existence of a maximal element in a poset” just screams Zorn’s lemma.

Distributivity is a requirement for non associative algebras. So whatever structure is left is not one of those

1 = Ω0 = Ω(Ω + Ω) = ΩΩ + ΩΩ = Ω + Ω = 0

so distributivity is out or else 1 = 0

I mean the specific issue about the binary blobs. Something that might set off alarm bells for you or a security-focused group may not do so for some dude working on a passion project in his free time.

Maybe they weren’t working on it.

Software to create bootable usb drives. It’s handy, you just copy ISOs into the drive and pick which one to boot into instead of overwriting the drive with a single ISO.

It’s a different situation, as a dev I’d happily bet my life on this assumption.

Dropping support for that stuff means breaking 95% of the websites people currently use. It’s a non-starter, it cannot ever happen, even if you think it would be for the best.

Math builds up so much context that it’s hard to avoid the use of shorthand and reused names for things. Every math book and paper will start with definitions. So it’s not really on you for not recognizing it here

🍕(–, B) : C -> Set denotes the contravariant hom functor, normally written Hom(–, B). In this case, C is a category, and B is a fixed object in that category. The – can be replaced by either an object or morphism of C, and that defines a map from C to Set.

For any given object X in C, the hom-set Hom(X, C) is the set of morphisms X -> B in C. For a morphism f : X -> Y in C, the Set morphism Hom(f, B) : Hom(Y, B) -> Hom(X, B) is defined by sending each g : Y -> B to gf : X -> B. This is the mapping C -> Set defined by Hom(–, C), and it’s a (contravariant) functor because it respects composition: if h : X -> Y and f : Y -> Z then fh : X -> Z and Hom(fh, C) = Hom(h, C)Hom(f, C) sends g : Z -> B to gfh : X -> B.

–

P^(n)® AKA RP^n is the n-dimensional real projective space.

–

The caveat “phi is a morphism” is probably just to clarify that we’re talking about “all morphisms X -> Y [in a given category]” and not simply all functions or something.

–

For more context, the derived functor of Hom(–, B) is called the Ext functor, and the exactness of that sequence (if the typo were fixed) is the statement of the universal coefficient theorem (for cohomology): https://en.wikipedia.org/wiki/Universal_coefficient_theorem The solution to this problem is the “Example: mod 2 cohomology of the real projective space” on that page. It’s (Z/2Z)[x] / <x^(n+1)> or 🍔[x]/<x^(n+1)>, i.e. the ring of polynomials of degree n or less with coefficients in 🍔 = Z/2Z, meaning coefficients of 0 or 1.

It’s not nonsense, although there is a typo that makes it technically unsolvable. If you fix the typo, it’s an example calculation in the wikipedia page on the universal coefficient theorem: https://en.m.wikipedia.org/wiki/Universal_coefficient_theorem

It’s real projective space