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: strong Church–Turing thesis | Statement: [Church–Turing thesis, hasVariant, strong Church–Turing thesis]

Target entity: strong Church–Turing thesis
Context triple: [Church–Turing thesis, hasVariant, strong 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. Cantor’s theorem
  Cantor’s theorem is a fundamental result in set theory stating that the power set of any set has a strictly greater cardinality than the set itself, implying there is no largest infinity.
• D. Blum axioms
  Blum axioms are a set of formal conditions introduced by Manuel Blum that rigorously define what constitutes a valid complexity measure in computational complexity theory.
• E. Tarski's undefinability theorem
  Tarski's undefinability theorem is a fundamental result in mathematical logic showing that, in sufficiently strong formal systems, the notion of truth for the language of the system cannot be defined within that same language.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.