Symbolic Computation for All the Fun
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910499371745280 |
|---|---|
| author | Brown, Chad E. Janota, Mikoláš Olšák, Mirek |
| author_facet | Brown, Chad E. Janota, Mikoláš Olšák, Mirek |
| contents | Motivated by the recent 10 million dollar AIMO challenge, this paper targets the problem of finding all functions conforming to a given specification. This is a popular problem at mathematical competitions and it brings about a number of challenges, primarily, synthesizing the possible solutions and proving that no other solutions exist. Often, there are infinitely many solutions and then the set of solutions has to be captured symbolically. We propose an approach to solving this problem and evaluate it on a set of problems that appeared in mathematical competitions and olympics. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_12048 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Symbolic Computation for All the Fun Brown, Chad E. Janota, Mikoláš Olšák, Mirek Logic in Computer Science Motivated by the recent 10 million dollar AIMO challenge, this paper targets the problem of finding all functions conforming to a given specification. This is a popular problem at mathematical competitions and it brings about a number of challenges, primarily, synthesizing the possible solutions and proving that no other solutions exist. Often, there are infinitely many solutions and then the set of solutions has to be captured symbolically. We propose an approach to solving this problem and evaluate it on a set of problems that appeared in mathematical competitions and olympics. |
| title | Symbolic Computation for All the Fun |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2404.12048 |