• 0 posts
  • 2 comments
Joined 2 years ago
Cake day: March 8th, 2025
  • Wait, did it prove the RH or disprove it? A proof would be impressive, though not necessarily as indicative of intelligence as Sam Altman would want you to think; a disproof could just be a counterexample, though, which could be generated by < 100 lines of code and enough compute. Given the amount of compute available to LLMs, that’s not really impressive at all. They could literally have just found the highest number anyone has confirmed doesn’t disprove the RH and then checked each higher number in a loop.