Building on work by Alfonseca et al. (2021), we study the conditions necessary for it to be logically possible to prove that an arbitrary artificially intelligent machine will exhibit certain behavior. To do this, we develop a formalism like -- but mathematically distinct from -- the theory of formal languages and their properties. Our formalism affords a precise means for not only talking about the traits we desire of machines (such as them being intelligent, contained, moral, and so forth), but also for detailing the conditions necessary for it to be logically possible to decide whether a given arbitrary machine possesses such a trait or not. Contrary to Alfonseca et al.'s (2021) results, we find that Rice's theorem from computability theory cannot in general be used to determine whether an arbitrary machine possesses a given trait or not. Therefore, it is not necessarily the case that deciding whether an arbitrary machine is intelligent, contained, moral, and so forth is logically impossible.

研究人工智能机器展现特定行为的逻辑可能性所需的条件，提出了一种与形式语言理论数学上不同但类似的形式化方法，并描述了判定给定任意机器是否具有某种特性的逻辑可能性所需的条件。与先前研究结果不同，发现计算可行性理论中的Rice定理通常无法确定任意机器是否具有给定特性，因此决定任意机器是否具有智能、可控性、道德性等特性并不一定是逻辑上不可能的。

关于智能机器的形式上不可判定特征