Live data from Hacker News

AGI is Mathematically Impossible 2: When Entropy Returns

philarchive.org

191–200 of 437 posts

Re: AGI is Mathematically Impossible 2: When Entropy Returns

#191

Earlier quoted context omitted.

Thanks for this - Looking forward to reading the full paper. That said, the most obvious objection that comes to mind about the title is that … well, I feel that I’m generally intelligent, and therefore general intelligence of some sort is clearly not impossible. Can you give a short précis as to how you are distinguishing humans and the “A” in artificial?

Sure I can (and thanks for writing) Well, given the specific way you asked that question I confirm your self assertion - and am quite certain that your level of Artificiality converges to zero, which would make you a GI without A... - You stated to "feel" generally intelligent (A's don't feel and don't have an "I" that can feel) - Your nuanced, subtly ironic and self referential way of formulating clearly suggests th…

It's simple: Either your proof holds for NGI as much as for AGI, or neither, or you can clearly define what differentiates them that makes it work for one and not the other.

Re: AGI is Mathematically Impossible 2: When Entropy Returns

#192
Doesn't this apply only to the toy AGI constructed for these examples which consists of an LLM and some prompt that generates infinite "analysis"?

It just seems like the consequences of simply setting an LLM with a fixed response length would be wildly different.

Re: AGI is Mathematically Impossible 2: When Entropy Returns

#193
post #173

This paper presents a theoretical proof that AGI systems will structurally collapse under certain semantic conditions — not due to lack of compute, but because of how entropy behaves in heavy-tailed decision spaces. The idea is called IOpenER: Information Opens, Entropy Rises. It builds on Shannon’s information theory to show that in specific problem classes (those with α ≤ 1), adding information doesn’t reduce uncer…

Unless you can prove that humans exceed the Turing computable, the headline is nonsense unless you can also show that the Church-Turing thesis isn't true. Since you don't even appear to have dealt with this, there is no reason to consider the rest of the paper.

> In plain language:

> No matter how sophisticated, the system MUST fail on some inputs.

Well, no person is immune to propaganda and stupididty, so I don't see it as a huge issue.

Re: AGI is Mathematically Impossible 2: When Entropy Returns

#194

This paper presents a theoretical proof that AGI systems will structurally collapse under certain semantic conditions — not due to lack of compute, but because of how entropy behaves in heavy-tailed decision spaces. The idea is called IOpenER: Information Opens, Entropy Rises. It builds on Shannon’s information theory to show that in specific problem classes (those with α ≤ 1), adding information doesn’t reduce uncer…

> specific problem classes (those with α ≤ 1),

For the layman, what does α mean here?

Re: AGI is Mathematically Impossible 2: When Entropy Returns

#195

Earlier quoted context omitted.

“This paper presents a theoretical proof that AGI systems will structurally collapse under certain semantic conditions…” No it doesn’t. Shannon entropy measures statistical uncertainty in data. It says nothing about whether an agent can invent new conceptual frames. Equating “frame changes” with rising entropy is a metaphor, not a theorem, so it doesn’t even make sense as a mathematical proof. This is philosophical m…

Correct: Shannon entropy originally measures statistical uncertainty over a fixed symbol space. When the system is fed additional information/data, then entropy goes down, uncertainty falls. This is always true in situations where the possible outcomes are a) sufficiently limited and b)unequally distributed. In such cases, with enough input, the system can collapse the uncertainty function within a finite number of s…

Your paper only claims that those Coq snippets constitute a "constructive proof sketch". Have those formalizations actually been verified, and if so, why not include the results in the paper?

Separately from that, your entire argument wrt Shannon hinges on this notion that it is applicable to "semantic spaces", but it is not clear on what basis this jump is made.

Re: AGI is Mathematically Impossible 2: When Entropy Returns

#196

Without reading the paper how the heck is agi mathematically impossible if humans are possible? Unless the paper is claiming humans are mathematically impossible? I’ll read the paper but the title comes off as out of touch with reality.

> Without reading the paper how the heck is agi mathematically impossible if humans are possible? Unless the paper is claiming humans are mathematically impossible? Humans are provably impossible to accurately simulate using our current theoretical models which treat time as continuous. If we could prove that there's some resolution, or minimum time step, (like Planck Time) below which time does not matter and we upd…

Finding something about physics that can't be perfectly represented is step one.

Then we also need evidence it can't be approximated to arbitrary quality.

And finally we need evidence that this physical effect is necessary for humans to think intelligently.

Re: AGI is Mathematically Impossible 2: When Entropy Returns

#197

The crux here is the definition of AGI. The author seems to say that only an endgame, perfect information processing system is AGI. But that definition is too strict because we might develop something that is very far from perfect but which still feels enough like AGI to call it that.

Thats like calling a cupboard a fridge cuz you can keep food in it. The paper clearly sets out to try and prove that the ideal definition of AGI is practically impossible.

We already have much easier proofs that no system is perfect. So if it's only trying to disprove perfect AGI, it's both clickbait and redundant.

Re: AGI is Mathematically Impossible 2: When Entropy Returns

#198

This paper presents a theoretical proof that AGI systems will structurally collapse under certain semantic conditions — not due to lack of compute, but because of how entropy behaves in heavy-tailed decision spaces. The idea is called IOpenER: Information Opens, Entropy Rises. It builds on Shannon’s information theory to show that in specific problem classes (those with α ≤ 1), adding information doesn’t reduce uncer…

Apple's paper sets up a bit of a straw man in my opinion. It's unreasonable to expect that an LLM not trained on what are essentially complex algorithmic tasks is just going to discover the solution on the spot. Most people can solve simple cases of the tower of Hanoi, and almost none of us can solve complex cases. In general, the ones who can have trained to be able to do so.

Re: AGI is Mathematically Impossible 2: When Entropy Returns

#199

From that paper: There exists a class of questions in life that appear remarkably simple in structure and yet contain infinite complexity in their resolution space. Consider the familiar or even archetypal inquiry: "Darling, please be honest: have I gained weight?"

"Darling, honestly, it's a hat, you look great."
Post reply on HN