Nice article, though I have a question: I might well misunderstand the whole subject, but doesn't "concrete incompletness" show up in many problems related the length of arbitrary programs like in the halting problem or the kolmogorov complexity, some of them with many potential practical applications were they not undecidable?
Nice article, though I have a question: I might well misunderstand the whole subject, but doesn't "concrete incompletness" show up in many problems related the length of arbitrary programs like in the halting problem or the kolmogorov complexity, some of them with many potential practical applications were they not undecidable?