最終更新日：2024/08/05

(computing theory) A theorem stating that all nontrivial semantic properties of programs are undecidable.

正解を見る

Rice's theorem

問題を編集する

元となった辞書の項目

Rice's theorem

name

(computing theory) A theorem stating that all nontrivial semantic properties of programs are undecidable.

Rice's theorem is a fundamental result in computability theory.

意味（1）

(computing theory) A theorem stating that all nontrivial semantic properties of programs are undecidable.