4 ms·

Aside from seemingly being 100% AI-generated, this article makes a really spurious use of Godel's argument, which I think is best exemplified by the following p

Aside from seemingly being 100% AI-generated, this article makes a really spurious use of Godel's argument, which I think is best exemplified by the following passage near the end: "These four threads share a common ancestor in what Gödel proved in 1931, and Turing sharpened in 1936. Rule-based systems cannot fully account for themselves. A system cannot certify its own trustworthiness. A learning framework cannot determine its own boundaries. A safety strategy cannot verify its own completeness. None of this is softened by the fact that a neural network feels organic rather than rule-like. A model’s weights are numbers, and its training is arithmetic, all of it running on von Neumann’s realisation of Turing’s imaginary device. AI is not adjacent to this mathematics. AI is made of it. The AI industry, understandably, would rather not dwell on this. " This is a complete non-sequitur. Godel's argument isn't even that profound: it just says that a system of axioms good enough to embed standard natural number arithmetic must be independent of a certain constructed sentence, i.e., it will run the same whether that sentence is true or false and you can't tell from its axioms which of these two options is in effect. While that sucks for philosophers, it doesn't make mathematics less useful, less dependable, or less correct in a practical sense. It has no practical implications to anything that the AI industry is promising today.

c2c2c 3mo ago
I think this is selling Gödel a little bit short. He proved for the first time that in any system of mathematics with enough complexity to be interesting, there are statements that cannot be proven true or false. The Gödel sentence might seem like a trivial example, but other examples of such things have been discovered since, such as the continuum hypothesis which the article mentions.
- skippyfish 3mo ago
  The article is massively overstating the implications of Godel to the AI industry, so to be clear - are you defending the article, or are we bikeshedding about my phrasing? Because my "not that profound" should be interpreted as relative to the article.
  - srean 3mo ago
    Ah that "with me or against me" dichotomy again.
- pdonis 3mo ago
  > n any system of mathematics with enough complexity to be interesting, there are statements that cannot be proven true or false. Note that the article itself is not as careful as you are here about correctly stating what Godel's Incompleteness Theorem actually says. The article states it this way: "any set of rules powerful enough to handle basic arithmetic will contain true statements it cannot prove". But that's wrong, because, when you take into account Godel's Completeness Theorem, you realize that, for any formal system complex enough for the proof of Godel's Incompleteness Theorem to go through, there must be a semantic model of that system in which the Godel sentence for that system is false! The article's misstatement is unfortunately very common, but it's still a misstatement.
- Animats 3mo ago
  > enough complexity to be interesting That's the loophole. There is mathematics without infinity.[1] Until recently, it was considered somewhat fringe. But there's been enough development that it's now clear you can do mathematics without infinity. In that view, infinities are a labor-saving device to get rid of special cases. They're not essential. Mathematicians used to hate special cases, but now that the active ones all grew up with computers, they're not so scared of IF statements. You can have "arbitrarily large" but not "infinite". Boyer-Moore theory is like that. It starts out like Peano arithmetic. There is (ZERO) and (ADD1 (ZERO)) and (EQUALP A B) and (LESSP A B) as predicates. That's the axiomatic basis. Numbers are (ADD1 (ADD1 (ADD1 (ZERO)))), etc. You can have recursive functions, but they must terminate. They must have a value which, for each recursion, is LESSP than the previous iteration. That's how you prove termination. You can do most of mathematics that way. But not infinitesimals. You never can get to 1 + 1/2 + 1/4 + 1/8 ... = 2 in that kind of constructive mathematics. That requires an infinite recursion, which is not allowed. [1] https://engtechnica.com/rethinking-mathematics-without-infinity/ https://engtechnica.com/rethinking-mathematics-without-infin...
- jibal 3mo ago
  The Gödel sentence (which is not otherwise of any interest) is true but unprovable within that axiomatic system. The Continuum hypothesis (which is of great interest) is true or false only by stipulation. The fact is that neither Gödel's theorems nor the Halting Problem have any actual real world consequences (outside of people talking about them). People say "oh, we can't write a verifier because of the Halting Problem", but that's simply not true since all of our programs are actually FSMs with physically limited data, and the HP is solvable for that subset of TMs. The real limitations are time and space, so this is an engineering problem -- and people who aren't suckered by Halting Problem Hysteria find engineering solutions that work on real programs, bailing if memory or time thresholds are exceeded.
hardbass 3mo ago
The worse confusion they seem to have is they think mathematical theorems are only applicable to "computers". Mathematical theorems have no escape, they apply just as much to human brains as to computers. If these theorems were a blocker for developing general intelligence then how do humans exist.
- Diogenesian 3mo ago
  Gödel believed the human brain used non-mathematical reasoning (i.e. inexpressible with a Turing machine) to derive the axioms and thus could "see outside" of any particular axiom schema. The Church-Turing thesis throws cold water on this: since the human body (including brain) is describable by a finite system of Schrödinger equations, and these equations can be solved numerically by a Turing machine, the human process of creating an axiom scheme should be Turing-computable. But some recent results on very large finite numbers (busy beaver) suggest there may be a subtlety here, e.g. complexity blows up to the point that it takes far more energy than the sun to simulate one human. The more interesting subtlety: for a physically meaningful result you would need to define configuration space very carefully, e.g. not screwing up the boundary consitions or causal order of subsystems. Perhaps defining this is actually not computable, and after every delta(t) in a computer simulation, a human has to check the physics and redefine certain parameters of the system. Solving the Schrodinger equation numerically is certainly Turing-computable, but the process of ensuring that solution is physically meaningful isn't even slightly formalized. It may be unformalizable.
  - hardbass 3mo ago
    Some problem being too chaotic or computationally expensive to perform is a completely different thing that claiming something supernatural. And there is hardly any reason for computers to be confined to silicon digital logic, using coprocessors is a standard procedure, so whatever element if any which exhibits hypercomputation (which is highly doubtful as the universe barely even reaches even a small fraction of the possibilities of turing machines let alone beyond them) or otherwise more efficient classical computation, we can isolate the element and use it as a chip.
skybrian 3mo ago
I think you’re right about practicality. Seems like nonstandard models of arithmetic suggest that there are things we cannot know about all natural numbers, because some of them (nearly all of them) are “too high to work with.” They are too high when all you can do with them is write proofs about them using induction. There’s a sense in which the set of natural numbers is too big to be practically useful, but no smaller set makes sense when writing proofs. The set of numbers you can reach without using induction (say, by using a computer to check) isn’t well-defined. And that has nothing to do with AI’s limitations.
inigyou 3mo ago
Axiom systems feel like the ordinal numbers: you can keep building upwards as far as the eye can see, and even farther and you run out of useful reasons to do it long before you run out of axiom systems or numbers. "One!" "Two!" "Three!" "Infinity!" "Infinity plus one!" "Infinity plus two!" "Infinity plus infinity!" "Infinity times infinity!" "Infinity to the power of infinity!" "Infinity to the power of infinity to the power of infinity!" "The supremum of all ordinals that can be expressed in a finite sequence of symbols!" "The supremum of all ordinals that can be expressed in a finite sequence of symbols plus one!"

c2c2c 3mo ago

I think this is selling Gödel a little bit short. He proved for the first time that in any system of mathematics with enough complexity to be interesting, there are statements that cannot be proven true or false. The Gödel sentence might seem like a trivial example, but other examples of such things have been discovered since, such as the continuum hypothesis which the article mentions.

skippyfish 3mo ago
The article is massively overstating the implications of Godel to the AI industry, so to be clear - are you defending the article, or are we bikeshedding about my phrasing? Because my "not that profound" should be interpreted as relative to the article.
- srean 3mo ago
  Ah that "with me or against me" dichotomy again.
pdonis 3mo ago
> n any system of mathematics with enough complexity to be interesting, there are statements that cannot be proven true or false. Note that the article itself is not as careful as you are here about correctly stating what Godel's Incompleteness Theorem actually says. The article states it this way: "any set of rules powerful enough to handle basic arithmetic will contain true statements it cannot prove". But that's wrong, because, when you take into account Godel's Completeness Theorem, you realize that, for any formal system complex enough for the proof of Godel's Incompleteness Theorem to go through, there must be a semantic model of that system in which the Godel sentence for that system is false! The article's misstatement is unfortunately very common, but it's still a misstatement.
Animats 3mo ago
> enough complexity to be interesting That's the loophole. There is mathematics without infinity.[1] Until recently, it was considered somewhat fringe. But there's been enough development that it's now clear you can do mathematics without infinity. In that view, infinities are a labor-saving device to get rid of special cases. They're not essential. Mathematicians used to hate special cases, but now that the active ones all grew up with computers, they're not so scared of IF statements. You can have "arbitrarily large" but not "infinite". Boyer-Moore theory is like that. It starts out like Peano arithmetic. There is (ZERO) and (ADD1 (ZERO)) and (EQUALP A B) and (LESSP A B) as predicates. That's the axiomatic basis. Numbers are (ADD1 (ADD1 (ADD1 (ZERO)))), etc. You can have recursive functions, but they must terminate. They must have a value which, for each recursion, is LESSP than the previous iteration. That's how you prove termination. You can do most of mathematics that way. But not infinitesimals. You never can get to 1 + 1/2 + 1/4 + 1/8 ... = 2 in that kind of constructive mathematics. That requires an infinite recursion, which is not allowed. [1] https://engtechnica.com/rethinking-mathematics-without-infinity/ https://engtechnica.com/rethinking-mathematics-without-infin...
jibal 3mo ago
The Gödel sentence (which is not otherwise of any interest) is true but unprovable within that axiomatic system. The Continuum hypothesis (which is of great interest) is true or false only by stipulation. The fact is that neither Gödel's theorems nor the Halting Problem have any actual real world consequences (outside of people talking about them). People say "oh, we can't write a verifier because of the Halting Problem", but that's simply not true since all of our programs are actually FSMs with physically limited data, and the HP is solvable for that subset of TMs. The real limitations are time and space, so this is an engineering problem -- and people who aren't suckered by Halting Problem Hysteria find engineering solutions that work on real programs, bailing if memory or time thresholds are exceeded.

hardbass 3mo ago

The worse confusion they seem to have is they think mathematical theorems are only applicable to "computers". Mathematical theorems have no escape, they apply just as much to human brains as to computers. If these theorems were a blocker for developing general intelligence then how do humans exist.

Diogenesian 3mo ago
Gödel believed the human brain used non-mathematical reasoning (i.e. inexpressible with a Turing machine) to derive the axioms and thus could "see outside" of any particular axiom schema. The Church-Turing thesis throws cold water on this: since the human body (including brain) is describable by a finite system of Schrödinger equations, and these equations can be solved numerically by a Turing machine, the human process of creating an axiom scheme should be Turing-computable. But some recent results on very large finite numbers (busy beaver) suggest there may be a subtlety here, e.g. complexity blows up to the point that it takes far more energy than the sun to simulate one human. The more interesting subtlety: for a physically meaningful result you would need to define configuration space very carefully, e.g. not screwing up the boundary consitions or causal order of subsystems. Perhaps defining this is actually not computable, and after every delta(t) in a computer simulation, a human has to check the physics and redefine certain parameters of the system. Solving the Schrodinger equation numerically is certainly Turing-computable, but the process of ensuring that solution is physically meaningful isn't even slightly formalized. It may be unformalizable.
- hardbass 3mo ago
  Some problem being too chaotic or computationally expensive to perform is a completely different thing that claiming something supernatural. And there is hardly any reason for computers to be confined to silicon digital logic, using coprocessors is a standard procedure, so whatever element if any which exhibits hypercomputation (which is highly doubtful as the universe barely even reaches even a small fraction of the possibilities of turing machines let alone beyond them) or otherwise more efficient classical computation, we can isolate the element and use it as a chip.

skybrian 3mo ago

I think you’re right about practicality. Seems like nonstandard models of arithmetic suggest that there are things we cannot know about all natural numbers, because some of them (nearly all of them) are “too high to work with.” They are too high when all you can do with them is write proofs about them using induction. There’s a sense in which the set of natural numbers is too big to be practically useful, but no smaller set makes sense when writing proofs. The set of numbers you can reach without using induction (say, by using a computer to check) isn’t well-defined. And that has nothing to do with AI’s limitations.

inigyou 3mo ago

Axiom systems feel like the ordinal numbers: you can keep building upwards as far as the eye can see, and even farther and you run out of useful reasons to do it long before you run out of axiom systems or numbers. "One!" "Two!" "Three!" "Infinity!" "Infinity plus one!" "Infinity plus two!" "Infinity plus infinity!" "Infinity times infinity!" "Infinity to the power of infinity!" "Infinity to the power of infinity to the power of infinity!" "The supremum of all ordinals that can be expressed in a finite sequence of symbols!" "The supremum of all ordinals that can be expressed in a finite sequence of symbols plus one!"