Mr. Costantino said the design was not at fault and that the towering mast, which stood 237 feet tall, had not created “any kind of problem.”

“The ship was an unsinkable ship,” he said. “I say it, I repeat it.”

- Designer of sunken ship

the computational cost of operating over a matrix is always going to be convex relative to its size

This makes no sense - "convex" doesn't mean fast-growing. For instance a constant function is convex.

My university sends me checks occasionally, like when they overcharged the premium on my dental insurance. No idea why they can't just do an electronic transfer like for my stipend.

a brave editor spreads the truth

uh, or not

Yudkowskian Probability Theory

what a throwback

okay but if they hadn't done that we wouldn't have gotten this work of art

why tf can't she say the word "racist"? like is it supposed to be a dogwhistle insinuating similarity between "racist" and "leftist"??

I don't want to come and help "balance out" someone who thinks that using they/them pronouns is worse than committing genocide.

Does anyone really think this, or are you just using hyperbole?

Not hyperbole. Hanania, Manifest promoted speaker, wrote "Why Do I Hate Pronouns More Than Genocide?" in May 2022.

I just can't, it's like that one scene from Austin Powers.

Isn't it like not real money? Or have they changed that

and here i just assumed the name was original to ffxiv

The article is very poorly written, but here's an explanation of what they're saying. An "inductive Turing machine" is a Turing machine which is allowed to run forever, but for each cell of the output tape there eventually comes a time after which it never modifies that cell again. We consider the machine's output to be the sequence of eventual limiting values of the cells. Such a machine is strictly more powerful than Turing machines in that it can compute more functions than just recursive ones. In fact it's an easy exercise to show that a function is computable by such a machine iff it is "limit computable", meaning it is the pointwise limit of a sequence of recursive functions. Limit computable functions have been well studied in mainstream computer science, whereas "inductive Turing machines" seem to mostly be used by people who want to have weird pointless arguments about the Church-Turing thesis.