Computational discovery in pure mathematics

7Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Colton, S. (2007). Computational discovery in pure mathematics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4660 LNAI, pp. 175–201). Springer Verlag. https://doi.org/10.1007/978-3-540-73920-3_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free