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: Church–Turing thesis | Statement: [Halting problem, relatedTo, Church–Turing thesis]

Target entity: Church–Turing thesis
Context triple: [Halting problem, relatedTo, Church–Turing thesis]

• A. Church–Turing thesis chosen
  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).
• B. Turing machine
  A Turing machine is an abstract computational model that manipulates symbols on an infinite tape according to a set of rules, providing a formal foundation for the concept of algorithm and computability.
• C. Halting problem
  The halting problem is a fundamental decision problem in computability theory that asks whether a given program will eventually stop running or continue to run forever, and is famously proven to be undecidable.
• D. Entscheidungsproblem
  The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
• E. Gödel's incompleteness theorems
  Gödel's incompleteness theorems are two fundamental results in mathematical logic showing that any sufficiently powerful, consistent formal system cannot prove all true statements about arithmetic, and cannot prove its own consistency.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.