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: Turing reducibility | Statement: [Computability Theory, fieldOfStudy, Turing reducibility]

Target entity: Turing reducibility
Context triple: [Computability Theory, fieldOfStudy, Turing reducibility]

• A. Computability Theory
  Computability Theory is a branch of theoretical computer science and mathematical logic that studies which problems can be solved by algorithms and how efficiently they can be computed.
• B. Karp reductions
  Karp reductions are polynomial-time many-one reductions used in computational complexity theory to show that one decision problem is at least as hard as another, central to defining NP-completeness.
• C. 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.
• D. Church–Turing thesis
  The Church–Turing thesis is a foundational principle in computability theory stating that any function that can be effectively computed by an algorithm can be computed by a Turing machine (or equivalently by other formal models of computation).
• E. Kolmogorov complexity
  Kolmogorov complexity is a measure of the amount of information in an object, defined as the length of the shortest computer program that can produce it.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Turing reducibility
Triple: [Computability Theory, fieldOfStudy, Turing reducibility]

Turing reducibility is a central computability-theoretic notion that compares the relative computational difficulty of decision problems by allowing one problem to be solved using an oracle for another.

Target entity: Turing reducibility
Target entity description: Turing reducibility is a central computability-theoretic notion that compares the relative computational difficulty of decision problems by allowing one problem to be solved using an oracle for another.

• A. Computability Theory
  Computability Theory is a branch of theoretical computer science and mathematical logic that studies which problems can be solved by algorithms and how efficiently they can be computed.
• B. Karp reductions
  Karp reductions are polynomial-time many-one reductions used in computational complexity theory to show that one decision problem is at least as hard as another, central to defining NP-completeness.
• C. 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.
• D. Church–Turing thesis
  The Church–Turing thesis is a foundational principle in computability theory stating that any function that can be effectively computed by an algorithm can be computed by a Turing machine (or equivalently by other formal models of computation).
• E. Kolmogorov complexity
  Kolmogorov complexity is a measure of the amount of information in an object, defined as the length of the shortest computer program that can produce it.
• F. None of above. chosen