• 0 Posts
  • 11 Comments
Joined 3 years ago
cake
Cake day: September 25th, 2023

help-circle

  • I’ve seen a Claude screenshot posted in a community of computer scientists where it “proved” P=NP through circular reference and cursed mathematics.

    For context, P and NP are sets of problems. If an algorithm exists where the time it takes to determine if a solution to a problem is correct scales polinomially relative to its input size, it’s in NP. If the time to solve the problem scales polinomially, it’s also in P, a subset of NP.

    The question now is if P = NP: Is every problem we can verify in polinomial time also solvable in polinomial time? We just don’t know, although we think it probably isn’t. But that’s just a guess.

    So someone asked Claude and it came up with: https://fixupx.com/connacher_/status/2079541927553212471 which, to a maths person, is hillariously incorrect.

    I just don’t trust in AI’s ability to reliably produce true statements.









  • That’s actually a good idea if they’re dealing with such campaigns. See it as the moderators (wo exist either way) directing their attention to places where violations are more likely to happen. Sure, DM monitoring sounds a bit intrusive, but admins reading your DMs was always a possibility and with the right user education, it shouldn’t be an issue.