Kogasa

Don’t think it saves bandwidth unless it’s a DNS level block, which IT should also do but separately from uBO

Java is a fine choice. Much prefer it over pseudocode.

I have read programs a lot shorter than 500 lines which I don’t have the expertise to write.

This has nothing to do with Windows or Linux. Crowdstrike has in fact broken Linux installs in a fairly similar way before.

Sure, throw people in jail who haven’t committed a crime, that’ll fix all kinds of systemic issues

Catch and then what? Return to what?

It sounds like you don’t understand the complexity of the game. Despite being finite, the number of possible games is extremely large.

These things are specifically not defined by the protocol. They could be. They’re not, by design.

It doesn’t, it just delegates the responsibility to something else, namely xdg-desktop-portal and/or your compositor. The main issue with global hotkeys is that applications can’t usually set them, e.g. Discord push-to-talk, rather the compositor has to set them and the application needs to communicate with the compositor. This is fundamentally different from how it worked with X11 so naturally adoption is slow.

Okay, but this makes more sense as an instance method rather than a static one

Instance properties are PascalCase.

Yeah, properties (like a field but with a getter and/or setter method, may or may not be backed by a field) are PascalCase

That’s an instance property

Yes, with Iosevka font

U good?

Stokes’ theorem. Almost the same thing as the high school one. It generalizes the fundamental theorem of calculus to arbitrary smooth manifolds. In the case that M is the interval [a, x] and ω is the differential 1-form f(t)dt on M, one has dω = f’(t)dt and ∂M is the oriented tuple {+x, -a}. Integrating f(t)dt over a finite set of oriented points is the same as evaluating at each point and summing, with negatively-oriented points getting a negative sign. Then Stokes’ theorem as written says that f(x) - f(a) = integral from a to x of f’(t) dt.

Your first two paragraphs seem to rail against a philosophical conclusion made by the authors by virtue of carrying out the Turing test. Something like “this is evidence of machine consciousness” for example. I don’t really get the impression that any such claim was made, or that more education in epistemology would have changed anything.

In a world where GPT4 exists, the question of whether one person can be fooled by one chatbot in one conversation is long since uninteresting. The question of whether specific models can achieve statistically significant success is maybe a bit more compelling, not because it’s some kind of breakthrough but because it makes a generalized claim.

Re: your edit, Turing explicitly puts forth the imitation game scenario as a practicable proxy for the question of machine intelligence, “can machines think?”. He directly argues that this scenario is indeed a reasonable proxy for that question. His argument, as he admits, is not a strongly held conviction or rigorous argument, but “recitations tending to produce belief,” insofar as they are hard to rebut, or their rebuttals tend to be flawed. The whole paper was to poke at the apparent differences between (a futuristic) machine intelligence and human intelligence. In this way, the Turing test is indeed a measure of intelligence. It’s not to say that a machine passing the test is somehow in possession of a human-like mind or has reached a significant milestone of intelligence.

https://academic.oup.com/mind/article/LIX/236/433/986238

I don’t think the methodology is the issue with this one. 500 people can absolutely be a legitimate sample size. Under basic assumptions about the sample being representative and the effect size being sufficiently large you do not need more than a couple hundred participants to make statistically significant observations. 54% being close to 50% doesn’t mean the result is inconclusive. With an ideal sample it means people couldn’t reliably differentiate the human from the bot, which is presumably what the researchers believed is of interest.

Hom functors exist for locally small categories, which is just to say that the hom classes are sets. The distinction can be ignored often because local smallness is a trivial consequence of how the category is defined, but it’s not generally true

I don’t really query, but it’s good enough at code generation to be occasionally useful. If it can spit out 100 lines of code that is generally reasonable, it’s faster to adjust the generated code than to write it all from scratch. More generally, it’s good for generating responses whose content and structure are easy to verify (like a question you already know the answer to), with the value being in the time saved rather than the content itself.