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 machine | Statement: [MIP = NEXP, assumesModelOfComputation, Turing machine]

Target entity: Turing machine
Context triple: [MIP = NEXP, assumesModelOfComputation, Turing machine]

• A. Turing machine chosen
  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.
• B. 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).
• C. Z3 computer
  The Z3 computer was an early electromechanical, programmable digital computer built by Konrad Zuse in 1941 and is often regarded as the world’s first working programmable computer.
• D. Analytical Engine
  The Analytical Engine was Charles Babbage’s pioneering 19th-century design for a fully programmable mechanical computer, featuring concepts like a central processing unit and memory that anticipated modern computing.
• E. Computing with Register Machines
  "Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target predicate: assumesModelOfComputation
Context triple: [MIP = NEXP, assumesModelOfComputation, Turing machine]

• A. computingModel chosen
  Indicates the computational framework, paradigm, or formal system used to perform or describe a computation.
• B. computes
  Indicates that one entity performs a calculation or processing operation to produce a result from given data or inputs.
• C. computationalClass
  Indicates that two entities share the same computational complexity class or that one entity is categorized within a specified computational complexity class.
• D. usesComputationMethod
  Indicates that an entity performs its processing or decision-making by applying a specified computational method or algorithm.
• E. computationInput
  Indicates that an entity serves as input data or parameters consumed by a computation or processing activity.
• F. None of above.