EuclideanSpace
euclideanspace.com
euclideanspace.com
Is this true?
Jokes aside, I assume they are referring to Gödel's incompleteness theorems, which might well reasonably be characterised in that way.
Some are simple enough to be decidable.
From wikipedia:
> The incompleteness theorems apply to formal systems that are of sufficient complexity to express the basic arithmetic of the natural numbers and which are consistent and effectively axiomatized.
> We partially prove the theorem of [7] that Tarski’s (extremely weak!) plane geometry axioms imply Hilbert’s axioms. https://sciendo.com/article/10.2478/forma-2014-0017
Also, thats for geometric space but I dont see how that's particularly relevant to this. Elsewhere I find that it doesn't contradict Gödel
See https://en.wikipedia.org/wiki/Agda_(programming_language) for a reasonably practical example:
> Agda is a total language, i.e., each program in it must terminate and all possible patterns must be matched.
And if so, would their domains of applicability within the universe of formal systems actually be a classification system of that universe in and of itself?
You must sacrifice one or the other. As we mostly care more about consistency (we don't want to make nonsense statements), completeness is sacrificed. Meaning, there will be things we can write down that we won't ever be able to prove true or false (relative to a set of axioms).
There are many other implications and subtleties, like potentially not being able to show a set of axioms is complete or consistent, potentially not being able to show the equivalence of axioms, not knowing whether adding an axiom is still consistent, etc.
Turing understood Godel's incompleteness theorem and applied it to computation. The computer science way of saying the above is that one can never make a program that can determine whether other programs halt or not (in finite time). Practically, this means that there will never be a compiler that will tell you whether you program has a bug. This is called the Halting Problem [1] and directly relates to Godel's incompleteness theorem as one can cast mathematics through the lens of computation and running Turing machines.
Presumably the "classification" here is some combination of whether models are equivalent or consistent and complete.
[0] https://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_...
We can't build a general 'halting determiner' for any arbitrary program.
But to say that for any particular program a halting machine can be developed is a different proposition.
A simple example is the fact we don't have to run this code for ever to determine if it halts or not:
``` while(true){}
```
but we won't ever get a function() named X that outputs halt/not where x(turning machine / computer program).
we able to, however, make a X(TM/C) where it outputs trivially halts or undetermined (past y steps).
The whole of mathematics and computer science is, in some sense, analyzing those programs which we can prove to halt.
You've made an important and very common mistake of not qualifying this: it only holds true within the system. If you are using the same logical/mathematical system to evaluate its own completeness or consistency, then Godels results apply. Using other systems we can examine and understand the truth of sentences; which is to say, a systems completeness and consistency.
Wikipedia includes this constraint:
> For any such consistent formal system, there will always be statements about natural numbers that are true, but that are unprovable within the system.
Few programmers and other on the internet understand the significance, often making reasoning about it wrong.
> Practically, this means that there will never be a compiler that will tell you whether you program has a bug.
TLA+ and other "external" systems can evaluate whether a program has a bug.
>> Practically, this means that there will never be a compiler that will tell you whether you program has a bug. > > TLA+ and other "external" systems can evaluate whether a program has a bug.
The main TLA+ model checker is TLC. It's pretty easy to write a TLA+ spec with a bug that TLC can't find (ironically by exploiting unbound model spaces, which are the Does Not Halt of model checking)
It's not a mistake. I've stated it clearly.
You're effectively qualifying it by saying you can add more axioms to extend the mathematical system to render previously incomplete statements complete. This comes at the cost of adding more incomplete statements. I can add the "The Riemmann hypothesis is true" as an axiom, say, and, assuming it's consistent with other axioms and actually adds some power that other axioms didn't, that might be fine, but this will create other statements that are also incomplete.
> TLA+ and other "external" systems can evaluate whether a program has a bug.
No, it won't.
From the Wikipedia entry [0]:
> The model checker finds all possible system behaviours up to some number of execution steps, and examines them for violations of desired invariance properties such as safety and liveness.
From this, at best this only does it out to a finite number of execution steps. I suspect this comes at the cost of exponential resources. So not only does it not find all bugs, the bugs it does find come at an increasingly intractable cost.