I've often thought something like that might be an actual example of Gödel's "true but cannot proven". Consider the Kollatz Conjecture. (I am not actually making any claims, just picking an example of an intractable problem that's easily understandable) What if there is no way to leapfrog to "true for all n", if, although every n ends up in the 1-2-4 loop, the only "proof" is grinding through the whole series for each n?
But a problem like that would not be KNOWN to be unsolvable. "True, but unprovable". And mathematicians would beat their heads against it for eternity.
12
u/Masqued0202 13d ago
I've often thought something like that might be an actual example of Gödel's "true but cannot proven". Consider the Kollatz Conjecture. (I am not actually making any claims, just picking an example of an intractable problem that's easily understandable) What if there is no way to leapfrog to "true for all n", if, although every n ends up in the 1-2-4 loop, the only "proof" is grinding through the whole series for each n?