Metraipolis › archive › dc_f1995214fde3

Beyond the Turing threshold: Productive grammars generate essentially undecidable languages — arXiv:2609.11385

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.11385
License (as archived)
CC0-1.0
Archived
2026-10-16T05:46:54.782Z
SHA-256 of the archived text
e4f4a1bff28718266b043227c31f63819ad7ddfaea8ea8e09de4fd2efe1a2248
Stable URL of this page
https://metraipolis.com/documento/dc_f1995214fde3

How to cite

Beyond the Turing threshold: Productive grammars generate essentially undecidable languages — arXiv:2609.11385 — arXiv (en), https://arxiv.org/abs/2609.11385 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f1995214fde3 (Metraipolis archive dc_f1995214fde3, sha256 e4f4a1bff28718266b043227c31f63819ad7ddfaea8ea8e09de4fd2efe1a2248)
BibTeX
@misc{dcf1995214fde3,
  title = {Beyond the Turing threshold: Productive grammars generate essentially undecidable languages — arXiv:2609.11385},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.11385},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f1995214fde3; sha256 e4f4a1bff28718266b043227c31f63819ad7ddfaea8ea8e09de4fd2efe1a2248},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11385. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Emil Post's productive sets are not even semi-computable, let alone computable, being thus essentially incomputable. Accordingly, formal languages whose set of words is a (completely) productive set are essentially undecidable. In this article, I elaborate on Post productivity from the viewpoint of formal language theory: I design formal grammars that emulate the construction of productive sets of natural numbers and are thus beyond Turing-decidability.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-11 in cs.CR).
Categorie arXiv: Formal Languages and Automata Theory (cs.FL) ; Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2609.11385 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T05:30:39.418Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).