Holophrasm: a neural Automated Theorem Prover for higher-order logic · HackerPapers discussions

Holophrasm: a neural Automated Theorem Prover for higher-order logic — mentioned by raphlinus

Sun, 25 Dec 2022 18:02:38 GMT

Do not nerd snipe me! There's tons of juice left on the CPU side. Again I recommend Metamath Zero (which is somewhat of an opposite direction as HoTT), as it's able to check the entire Metamath proof database in a few hundred milliseconds. This is orders of magnitude faster than most other proof systems. If you did want to manipulate trees on the GPU, then my stack monoid work[1] might be a good basis for it. Of course, a whole nother direction is to use AI to develop proofs, which is a fascinating and growing area (see Holophrasm[2] and DeepMind work[3]). That of course runs on the GPU. [1]…

Paper and discussion history. A mention is not an endorsement.

Holophrasm: a neural Automated Theorem Prover for higher-order logic — mentioned by drchewbacca

Sun, 29 Sep 2019 17:33:07 GMT

It's not really like that. NN's are only used when searching for new proofs or steps which can be used to fill in details, the verification of a finished proof is done by a classical program by a series of substitutions which are very straightforward and spelled out in detail. Here is an example. https://arxiv.org/pdf/1608.02644.pdf

Paper and discussion history. A mention is not an endorsement.

Holophrasm: a neural Automated Theorem Prover for higher-order logic — mentioned by drchewbacca

Sat, 24 Aug 2019 18:37:06 GMT

And another https://arxiv.org/pdf/1608.02644.pdf I'd really love to see someone like Deepmind get a hold of this. They are perfectly placed to apply a lot of resources to it and it's right in their wheelhouse. Don't know how to contact them about it though.

Paper and discussion history. A mention is not an endorsement.