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: Post correspondence problem | Statement: [Computability Theory, fieldOfStudy, Post correspondence problem]

Target entity: Post correspondence problem
Context triple: [Computability Theory, fieldOfStudy, Post correspondence problem]

• A. 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.
• B. 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.
• C. 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.
• D. Kleene’s recursion theorem
  Kleene’s recursion theorem is a fundamental result in computability theory that guarantees the existence of self-referential programs, allowing a program to effectively obtain and use its own description.
• E. Hilbert’s tenth problem
  Hilbert’s tenth problem is a famous unsolved question in mathematics that asked for a general algorithm to determine whether any given Diophantine equation has an integer solution, and whose negative answer helped establish fundamental limits of computability.
• 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: Post correspondence problem
Triple: [Computability Theory, fieldOfStudy, Post correspondence problem]

The Post correspondence problem is a classic undecidable decision problem in theoretical computer science and mathematical logic that plays a central role in demonstrating the limits of algorithmic computability.

Target entity: Post correspondence problem
Target entity description: The Post correspondence problem is a classic undecidable decision problem in theoretical computer science and mathematical logic that plays a central role in demonstrating the limits of algorithmic computability.

• A. 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.
• B. 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.
• C. 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.
• D. Kleene’s recursion theorem
  Kleene’s recursion theorem is a fundamental result in computability theory that guarantees the existence of self-referential programs, allowing a program to effectively obtain and use its own description.
• E. Hilbert’s tenth problem
  Hilbert’s tenth problem is a famous unsolved question in mathematics that asked for a general algorithm to determine whether any given Diophantine equation has an integer solution, and whose negative answer helped establish fundamental limits of computability.
• F. None of above. chosen