Also your paper has to be truly irredeemable dogshit to get rejected from arxiv. Like you can post proofs of P=NP as long as it sounds kinda coherent. 2400 monthly rejections is absurd.
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.
Well, it is true that computer programs have far surpassed humans in board games. They are very well suited for it. It just has nothing to do with the hypothesized abilities of future "AI" as rationalists conceive them.
flaviat explained why your counterexample is not correct. But also, the correct statement (Liouville's theorem) is that a bounded entire function must be constant.
Given consistent trends of exponential performance improvements over many years and across many industries, it would be extremely surprising if these improvements suddenly stopped.
Also your paper has to be truly irredeemable dogshit to get rejected from arxiv. Like you can post proofs of P=NP as long as it sounds kinda coherent. 2400 monthly rejections is absurd.