News for hackers. Stuff that matters.
Re:AI is forcing us to pay off 40 years of technical debt by Tryk on Wednesday November 04, 2026 @06:05PM (#50372701)
This is a misconception of what is being said in GEB.

Gödel's Incompleteness, very roughly, says that not every true statement (in a formal system) can be proven. In particular, it says that for classical logic with some arithmetic the statement holds; how you get to security I do not follow.

Perhaps you are connecting formal systems to computer programs through the Curry-Howard correspondence, but that correspondence is not between classical logic and computer programs but a related but different logic (called intuitionistic logic). In Intuitionistic logic you cannot prove Gödel's Incompleteness.

Re:AI is forcing us to pay off 40 years of technical debt by Balgair on Wednesday November 04, 2026 @11:09PM (#50375051)
Again, not a CS person.

The idea is that since you can make every security program turing complete, I thiiiiink?, then you can have it be a formal system. So, you can then get the code, in very tortured ways, to execute a paradox, thereby breaking it. Likely in enough ways to let you gain access, though not always.

Re:AI is forcing us to pay off 40 years of technical debt by Tryk on Thursday November 05, 2026 @02:11PM (#50383097)
I mean this in the nicest way, but I would never have dreamt to relate Gödel's incompleteness to this topic.

I think perhaps where I would diverge is that we should separate the language from the program. Generally, we say that a programming language is Turing complete.

Gödel's incompleteness is analogous to a paradox, e.g the Liar paradox, that is one useful way to understand the statement. But it seems as if you're saying it's a Contradiction (from where we can derive anything) something like EFQ: https://en.wikipedia.org/wiki/Principle_of_explosion

That does not follow, not all paradoxes are contradictions. For instance, just because Gödel's incompleteness pertains to first-order Logic does not mean that we can derive anything in first-order logic.