Project:Queries: Difference between revisions
From MaRDI portal
| Line 6: | Line 6: | ||
''Let's sort them alphabetically for now.'' | ''Let's sort them alphabetically for now.'' | ||
* Computational concepts included in K-12 algebra curricula | |||
* Integer sequences found in nature | * Integer sequences found in nature | ||
* Mathematical concepts whose first use in field A predates the first use in field B by time period C | * Mathematical concepts whose first use in field A predates the first use in field B by time period C | ||
* Proofs for theorem X that do involve method Y | * Proofs for theorem X that do involve method Y | ||
* Proofs for theorem X that do not involve method Y | * Proofs for theorem X that do not involve method Y | ||
* Sets that contain themselves | |||
* Sort algorithms ranked by computational complexity | |||
* Sort algorithms ranked by computational complexity | * Sort algorithms ranked by computational complexity | ||
* Unproven theorems ranked by number of papers published about them | * Unproven theorems ranked by number of papers published about them | ||
* Unproven theorems ranked by time since first publication | * Unproven theorems ranked by time since first publication | ||
Revision as of 22:52, 7 November 2022
About
This page assists with the documentation of queries relevant to the development and use of this portal. While the long-term intention is to provide executable versions of these queries, their initial formulation may well be on a conceptual level, with improvements expected, especially as the pertinent data models mature and relevant data are becoming available here.
Sample queries
Let's sort them alphabetically for now.
- Computational concepts included in K-12 algebra curricula
- Integer sequences found in nature
- Mathematical concepts whose first use in field A predates the first use in field B by time period C
- Proofs for theorem X that do involve method Y
- Proofs for theorem X that do not involve method Y
- Sets that contain themselves
- Sort algorithms ranked by computational complexity
- Sort algorithms ranked by computational complexity
- Unproven theorems ranked by number of papers published about them
- Unproven theorems ranked by time since first publication
