There appears to be a loophole in Goedel Incompleteness Theorem, vaguely
perceived for a long time but not clearly identified. (Thus, Goedel believed
informal arguments can answer any math question.) Closing this loophole does
not seem obvious and involves Kolmogorov complexity. (This is unrelated to,
well studied before, complexity quantifications of the usual Goedel effects.)