A non-recursively enumerable subset of $\mathbb{N}$ which has a short description in terms of arithmetic

Documenti analoghi

• On the representation of number-theoretic functions by arithmetic terms
  di: Prunescu, Mihai, et al.
  Pubblicazione: (2024)
• Six equations in search of a finite-fold-ness proof
  di: Cantone, Domenico, et al.
  Pubblicazione: (2023)
• On arithmetic terms expressing the prime-counting function and the n-th prime
  di: Prunescu, Mihai, et al.
  Pubblicazione: (2024)
• Undecidability on Diophantine equations over $\mathbb Z[i]$ with $20$ unknowns
  di: Matiyasevich, Yuri, et al.
  Pubblicazione: (2025)
• A computably enumerable many-one degree with no least finite-one degree
  di: Cintioli, Patrizio
  Pubblicazione: (2026)