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: Böhm–Jacopini theorem | Statement: [Go To Statement Considered Harmful, relatedConcept, Böhm–Jacopini theorem]

Target entity: Böhm–Jacopini theorem
Context triple: [Go To Statement Considered Harmful, relatedConcept, Böhm–Jacopini theorem]

• A. 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).
• B. The Logic of Computer Programming
  The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
• C. Hoare logic
  Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
• D. "The Complexity of Theorem-Proving Procedures"
  "The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
• 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. 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: Böhm–Jacopini theorem
Triple: [Go To Statement Considered Harmful, relatedConcept, Böhm–Jacopini theorem]

The Böhm–Jacopini theorem is a foundational result in computer science stating that any computer program can be written using only sequence, selection, and iteration constructs, without requiring goto statements.

Target entity: Böhm–Jacopini theorem
Target entity description: The Böhm–Jacopini theorem is a foundational result in computer science stating that any computer program can be written using only sequence, selection, and iteration constructs, without requiring goto statements.

• A. 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).
• B. The Logic of Computer Programming
  The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
• C. Hoare logic
  Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
• D. "The Complexity of Theorem-Proving Procedures"
  "The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
• 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. chosen