Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Rice–Shapiro theorem | Statement: [Rice's theorem, relatedTo, Rice–Shapiro theorem]

Target entity: Rice–Shapiro theorem
Context triple: [Rice's theorem, relatedTo, Rice–Shapiro theorem]

• A. Szekeres–Lindström theorem
  The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
• B. Kesten’s theorem
  Kesten’s theorem is a fundamental result in probability theory that characterizes when a random walk on a group is transient or recurrent, with deep implications for random walks on groups and percolation theory.
• C. Suslin rigidity theorem
  The Suslin rigidity theorem is a fundamental result in algebraic K-theory asserting strong invariance (rigidity) properties of K-theory for certain rings or schemes under extensions or deformations.
• D. Rice's theorem
  Rice's theorem is a fundamental result in computability theory stating that any non-trivial semantic property of the language recognized by a Turing machine is undecidable.
• E. Mazurkiewicz–Sierpiński theorem
  The Mazurkiewicz–Sierpiński theorem is a result in topology and measure theory that characterizes certain properties of measurable sets and mappings, particularly concerning continuous images of sets in Euclidean spaces.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Rice–Shapiro theorem
Target entity description: The Rice–Shapiro theorem is a result in computability theory that characterizes which sets of partial computable functions correspond to effectively enumerable (recursively enumerable) index sets, refining Rice’s theorem by focusing on positive information.

• A. Szekeres–Lindström theorem
  The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
• B. Kesten’s theorem
  Kesten’s theorem is a fundamental result in probability theory that characterizes when a random walk on a group is transient or recurrent, with deep implications for random walks on groups and percolation theory.
• C. Suslin rigidity theorem
  The Suslin rigidity theorem is a fundamental result in algebraic K-theory asserting strong invariance (rigidity) properties of K-theory for certain rings or schemes under extensions or deformations.
• D. Rice's theorem chosen
  Rice's theorem is a fundamental result in computability theory stating that any non-trivial semantic property of the language recognized by a Turing machine is undecidable.
• E. Mazurkiewicz–Sierpiński theorem
  The Mazurkiewicz–Sierpiński theorem is a result in topology and measure theory that characterizes certain properties of measurable sets and mappings, particularly concerning continuous images of sets in Euclidean spaces.
• F. None of above.