Robust Computer Algebra, Theorem Proving, and Oracle AI
Gopal P. Sarma, Nick J. Hay

TL;DR
This paper surveys the concept of oracles in superintelligent AI, focusing on computer algebra systems and theorem provers as domain-specific oracles, and discusses their potential for enhancing AI safety through provable guarantees.
Contribution
It identifies the limitations of current question-answering systems as oracles and proposes integrating computer algebra systems with theorem provers to address AI safety challenges.
Findings
Computer algebra systems are primitive domain-specific oracles for mathematics.
Integrating CASs with theorem provers presents concrete research challenges.
Architectural deficiencies in CASs impact their use as safe oracles.
Abstract
In the context of superintelligent AI systems, the term "oracle" has two meanings. One refers to modular systems queried for domain-specific tasks. Another usage, referring to a class of systems which may be useful for addressing the value alignment and AI control problems, is a superintelligent AI system that only answers questions. The aim of this manuscript is to survey contemporary research problems related to oracles which align with long-term research goals of AI safety. We examine existing question answering systems and argue that their high degree of architectural heterogeneity makes them poor candidates for rigorous analysis as oracles. On the other hand, we identify computer algebra systems (CASs) as being primitive examples of domain-specific oracles for mathematics and argue that efforts to integrate computer algebra systems with theorem provers, systems which have largely…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
