[sigmoid10]

We already have proofs by exhaustion that could only ever be verified using computers. Some people would argue they are not "elegant" but I don't think anyone would argue they are not math.

[SwtCyber]

But I wonder if there's a distinction between a proof that is merely computationally intensive and one that is conceptually inaccessible