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

  • I feel like you’re comparing apples and oranges here.

    There is a vast difference between the solution to an abstract mathematical problem, and a concrete real-world problem.

    The cure to cancer would have a direct benefit to humanity, cancer would be cured, less people would die.

    The answer to “Is the Reimann Hypothesis true?” does not have a direct benefit, especially if the answer is unverifiable (which an opaque insanely large blob of a program and paper most certainly are). The benifit of a solution to that question lie in both the cascading effect of it verifying other mathematical proofs that assume the Reimann Hypothesis is true, and the new insights that are developed in the process of solving it.

    3
    • 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