Boyer-Moore theorem prover
A LISP-driven theorem proving engine that has been used to derive many novel mathematical results, including decisions on some open questions in mathematics.
R. S. Boyer and J. S. Moore (1979).
PAGE NAVIGATOR(Help)
-
Artificial Intelligence Â»Artificial Intelligence
Are thinking computers mathematically possible? [7] Â»Are thinking computers mathematically possible? [7]
No: computers are limited by Gödel's theorems Â»No: computers are limited by Gödel's theorems
Improved machines Â»Improved machines
The Gödelian insight has already been formalised Â»The Gödelian insight has already been formalised
Gödelization procedure algorithmically specifiable Â»Gödelization procedure algorithmically specifiable
Proof has been formalised into a program Â»Proof has been formalised into a program
Boyer-Moore theorem prover
+Commentaar (0)
+Citaten (0)
+About