Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

> Finding a proof in a formal language is trivially solvable in theory since you just have to search through possible proofs until you find one ending with the desired statement. The whole practical question is how much time it takes.

No, in my experience the whole practical question is, can it be found automatically, or can it not be found automatically? Because there is an exponential search space that conventional automated methods will not be able to chew through, it either works, or it doesn't. AlphaProof shows that for some difficult IMO problems, it works.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: