logoalt Hacker News

tsoukase • today at 7:20 PM • 1 reply • view on HN

IANAMathematician. This challenges the sole definition of a proof. Can a theorem be proved by proxy, without understanding the proof directly? Not to mention that its practical usefulness is exactly zero.

It seems the modern unsolved problems might have solutions incomprehensible by humans. So a new class of decidable problems emerges: llm-complete ones.


Replies

beanshadow • today at 7:38 PM

There is a correspondence between proofs and computer programs. Any time someone vibe-codes, there is a vibe-proof being proved. Lots of programs can be run without understanding the code directly.

https://en.wikipedia.org/wiki/Curry–Howard_correspondence