Skip to content

Comment on How can a fancy autocomplete / stochastic parrot solve the Riemann Hypothesis?

You are viewing one comment and its replies. View all comments · View the comment above

Comments

  • if the answer is unverifiable (which an opaque insanely large blob of a program and paper most certainly are).

    Just to clarify, the LEAN system used for writing up the proof is exactly meant for verifiability, and is pretty solid as I understand it. It’s built to programmatically verify the logic consistency and truth of each step of the proof, which is sufficient to verify the total proof.

    0

Sign in to comment. Sign in