logoalt Hacker News

pegasuslast Tuesday at 10:45 PM1 replyview on HN

The proof is verified mechanically - it's very easy to verify that a proof is correct, what's hard is coming up with the proof (it's an NP problem). There can still be gotchas, especially if the statement proved is complex, but it does help a lot in keeping bugs away.


Replies

worldsayshilast Tuesday at 11:00 PM

How often can the hardness be exchanged with tediousness though? Can at least some of those problems be solved by letting the AI try until it succeeds?

show 1 reply