AI 中文总结
本文从形式语言理论视角，设计模拟波斯特生产性集合构造的生成文法，以生成本质上不可判定的语言，超越图灵可判定性。
AI 中文摘要
埃米尔·波斯特的生产性集合甚至不是半可计算的，更不用说可计算了，因此本质上是不可计算的。相应地，其词集为（完全）生产性集合的形式语言本质上是不可判定的。在本文中，我从形式语言理论的角度阐述波斯特生产性：我设计了模拟自然数生产性集合构造的形式文法，从而超越了图灵可判定性。
英文摘要
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.
CommentsKey words: Post productivity; Completely productive set; Turing-decidability; Essential undecidability; Productive grammar; Productive grammar. This work will be developed from the viewpoint of theoretical computer virology
