Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Rice's_theorem
|
| gptkbp:appliesTo |
Turing machines
recursively enumerable languages |
| gptkbp:category |
gptkb:theoretical_computer_science
|
| gptkbp:field |
computability theory
|
| gptkbp:namedAfter |
gptkb:Henry_Gordon_Rice
|
| gptkbp:publicationYear |
1953
|
| gptkbp:relatedTo |
undecidability
halting problem |
| gptkbp:sentence |
All non-trivial semantic properties of programs are undecidable
|
| gptkbp:statedIn |
gptkb:Rice's_1953_paper
|
| gptkbp:bfsParent |
gptkb:Rice's_theorem
|
| gptkbp:bfsLayer |
5
|
| https://www.w3.org/2000/01/rdf-schema#label |
Rice's law
|