Treffer: Artificial Intelligence and Inherent Mathematical Difficulty Open Access.

This paper explores the relationship of artificial intelligence to resolving open questions in mathematics. We first argue that limitative results from computability and complexity theory retain their significance in illustrating that proof discovery is an inherently difficult problem. We next consider how applications of automated theorem proving, Sat -solvers, and large language models raise underexplored questions about the nature of mathematical proof — e.g. about the status of brute force and the relationship between logical and discovermental complexity. Nevertheless, we finally suggest that the results obtained thus far by automated methods do not tell against the inherent difficulty of proof discovery. [ABSTRACT FROM AUTHOR]

Copyright of Philosophia Mathematica is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)