aio

i think it's when you and a bunch of other vegans live in a tiny group home together and argue over who does the dishes

a lot of this "computational irreducibility" nonsense could be subsumed by the time hierarchy theorem which apparently Stephen has never heard of

He straight up misstates how NP computation works. Essentially he writes that a nondeterministic machine M computes a function f if on every input x, there exists a path of M(x) which outputs f(x). But this is totally nonsense - it implies that a machine M which just branches repeatedly to produce every possible output of a given size "computes" every function of that size.

the ruliad is something in a sense infinitely more complicated. Its concept is to use not just all rules of a given form, but all possible rules. And to apply these rules to all possible initial conditions. And to run the rules for an infinite number of steps

So it's the complete graph on the set of strings? Stephen how the fuck is this going to help with anything

if two people disagree on a conclusion then either they disagree on the reasoning or the premises.

I don't think that's an accurate summary. In Aumann's agreement theorem, the different agents share a common prior distribution but are given access to different sources of information about the random quantity under examination. The surprising part is that they agree on the posterior probability provided that their conclusions (not their sources) are common knowledge.

Sorry for you and your cat. You did the right thing, but that doesn't make it any easier.

??????????????????

I'm also a big fan of the concurrency implementation, I wish other languages made it so easy to use green threads & channels.

P(hole)

article is informing me that it isn't X - it's Y

what i got from reading this is that it's not X, but Y.