Construct · 1 fields · 1 citations

Post correspondence problem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
Post correspondenceproblem1 CONSTRUCTPost correspondencePOST · THEORY OF COMPUTATION

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Theory of computation

the undecidable question of whether a list of string pairs has a sequence whose top and bottom concatenations are equal, used to prove other problems undecidable.

In theory of computation, Post correspondence problem refers to the undecidable question of whether a list of string pairs has a sequence whose top and bottom concatenations are equal, used to prove other problems undecidable. This meaning comes from Post (1946) in Bulletin of the American Mathematical Society.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how Post correspondence problem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

correspondence4 fields · 7 citationsjingle · one word, four constructslist1 fields · 1 citationsanchor · a standalone constructsequence3 fields · 3 citationsjingle · one word, three constructs

References

  1. Post, E. L. (1946). A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society, 52(4), 264-268. https://doi.org/10.1090/s0002-9904-1946-08555-9

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct