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: Elements of the Theory of Computation | Statement: [Harry Lewis, notableWork, Elements of the Theory of Computation]

Target entity: Elements of the Theory of Computation
Context triple: [Harry Lewis, notableWork, Elements of the Theory of Computation]

• A. Introduction to the Theory of Computation
  Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
• B. "Introduction to Automata Theory, Languages, and Computation"
  "Introduction to Automata Theory, Languages, and Computation" is a foundational textbook in theoretical computer science that systematically develops the theory of automata, formal languages, and computational complexity.
• C. 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.
• D. Computability and Unsolvability
  Computability and Unsolvability is a classic 1958 textbook by Martin Davis that systematically develops the theory of computable functions and undecidable problems, helping to shape modern computability theory.
• E. P, NP, and NP-Completeness: The Basics of Complexity Theory
  "P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
• 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: Elements of the Theory of Computation
Triple: [Harry Lewis, notableWork, Elements of the Theory of Computation]

Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.

Target entity: Elements of the Theory of Computation
Target entity description: Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.

• A. Introduction to the Theory of Computation
  Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
• B. "Introduction to Automata Theory, Languages, and Computation"
  "Introduction to Automata Theory, Languages, and Computation" is a foundational textbook in theoretical computer science that systematically develops the theory of automata, formal languages, and computational complexity.
• C. 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.
• D. Computability and Unsolvability
  Computability and Unsolvability is a classic 1958 textbook by Martin Davis that systematically develops the theory of computable functions and undecidable problems, helping to shape modern computability theory.
• E. P, NP, and NP-Completeness: The Basics of Complexity Theory
  "P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
• F. None of above. chosen