Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alternativeName |
gptkb:Rice's_law
|
| gptkbp:appliesTo |
Turing machines
recursively enumerable languages |
| gptkbp:author |
gptkb:Henry_Gordon_Rice
|
| gptkbp:consequence |
Undecidability of program properties
|
| gptkbp:field |
computability theory
theoretical computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Rice's theorem
|
| gptkbp:namedAfter |
gptkb:Henry_Gordon_Rice
|
| gptkbp:publicationYear |
1953
|
| gptkbp:publishedIn |
gptkb:Transactions_of_the_American_Mathematical_Society
|
| gptkbp:relatedTo |
gptkb:Halting_problem
Undecidability |
| gptkbp:sentence |
All non-trivial semantic properties of programs are undecidable.
|
| gptkbp:bfsParent |
gptkb:Myhill's_property
gptkb:Rice–Myhill–Shapiro_theorem |
| gptkbp:bfsLayer |
4
|