Linked from

The 13 pages that link to Computer-assisted proof, each with the reason it gives.

• Mathematical proofRelated: It tests how proof changes when machines verify large or complex steps.

• Deductive reasoningBroader topic: Computers can check extensive deductive derivations that exceed practical hand verification.

• Formal proofRelated: Some computer-assisted proofs include formal derivations, while others rely on specialized computations.

• Four color theoremNarrower topic: The theorem's proof made extensive computation part of an accepted mathematical argument.

• Symbolic computationRelated: Exact symbolic transformations can support proofs by checking algebraic identities and solving formal constraints.

• Philosophy of mathematicsRelated: Such proofs test whether mathematical knowledge requires human-checkable derivations.

• William ThurstonCompared with: Thurston’s emphasis on human understanding raises questions about what counts as an explanatory proof.

• Mathematical conjectureRelated: Computations can verify cases or steps that help settle a conjecture.

• Kepler conjectureNarrower topic: The original proof’s large case analysis made computation central to establishing the result.

• Feigenbaum constantsRelated: Later rigorous work confirmed the existence of the renormalization fixed point behind universality.

• Double bubble theoremRelated: Computational checks supported portions of the proof’s geometric case analysis.

• Grimm's conjectureRelated: Computational checks have verified bounded ranges of cases related to the conjecture.

• Reuschle's theoremRelated: Computation can check algebraic instances, though it does not replace a general proof.