mathoverflow.net/questions/11540/what-are-the-most-attractive-turing-undecidable-problems-in-mathematics/11557#11557 contains a good overview of the decidability status of variants over rings other than the integers.
Decidability of Hilbert's tenth problem of a given degree and number of variables by
Ciro Santilli 40 Created 2024-07-12 Updated 2025-07-16
Decidability of Hilbert's tenth problem in modular arithmetic by
Ciro Santilli 40 Created 2024-07-12 Updated 2025-07-16
E.g. International Mathematical Olympiad, International Physics Olympiad, competitive programming, etc.
The most triggering thing possible is when programming competitions don't release their benchmarks as open source software afterwards: at least like that they might help someone to solve their real world problems. Maybe.
Some irrelevant people highlight that knowledge Olympiads can have good effects, because they are "an opportunity to meet university teachers and their research organizations". Ciro's argument is just that there are much more efficient ways to achieve those goals.
As an alternative way to get into university, this is not 100% horrible however, e.g. the University of São Paulo accepted students from olympiads in 2019 and then again 2023: jornal.usp.br/institucional/usp-oferece-200-vagas-em-mais-de-100-cursos-de-graduacao-para-alunos-participantes-de-olimpiadas-do-conhecimento/?a
Resources to study for knowledge olympiads:
- savchenkosolutions.com contains collaboratively created solutions to the Savchenko Problems in Physics. It appears to be a frontend for: github.com/savchenko-physics/savchenko-solutions. Closed license, kind of sad.
Unlike over non-commutative rings, polynomials do look like proper polynomials over commutative ring.
In particular, Hilbert's tenth problem is about polynomials over the integers, which is a commutative ring, and therefore brings mindshare to this definition.
The output was also uploaded to: commons.wikimedia.org/wiki/File:DFT_2sin(t)_%2B_sin(4t).svg and added to en.wikipedia.org/w/index.php?title=Discrete_Fourier_transform&oldid=1176616763 only to be later removed of course: Deletionism on Wikipedia.
DFT of with 25 points
. Source code at: ../numpy/fft_plot.py.A hard problem ha been found for it, and it was called the "antihydra":
- news.ycombinator.com/item?id=40864949 BB(6), The 6th Busy Beaver Number, is harder than a Collatz-like math problem
- www.reddit.com/r/math/comments/1dubva0/finding_the_6th_busy_beaver_number_%CF%836_aka_bb6_is/ "Finding the 6th busy beaver number (Σ(6), AKA BB(6)) is at least as hard as a hard Collatz-like math problem called Antihydra":
- www.reddit.com/r/compsci/comments/1duc62e/finding_the_6th_busy_beaver_number_%CF%836_aka_bb6_is/
There are unlisted articles, also show them or only show them.