This is a heavily interactive web application, and JavaScript is required. Simple HTML interfaces are possible, but that is not what this is.
Post
Michael Pyne
blindmansbinary.bsky.social
did:plc:bt67dflqewmd677amdtx4mrb
Lots of parallels to the Comp. Sci. question of whether P = NP. If P ≠ NP (as most believe), then there are problems we can verify solutions to in "reasonable" time, but which we cannot solve in "reasonable" time. "This is true, and we know it's true, but I can't quickly tell you how to derive it"
2025-07-11T15:59:20.641Z