Computational Discovery in Pure Mathematics

13 years 8 months ago
Computational Discovery in Pure Mathematics
Abstract. We discuss what constitutes knowledge in pure mathematics and how new advances are made and communicated. We describe the impact of computer algebra systems, automated theorem provers, programs designed to generate examples, mathematical databases, and theory formation programs on the body of knowledge in pure mathematics. We discuss to what extent the output from certain programs can be considered a discovery in pure mathematics. This enables us to assess the state of the art with respect to Newell and Simon’s prediction that a computer would discover and prove an important mathematical theorem.
Simon Colton
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where DIS
Authors Simon Colton
Comments (0)