Recursively enumerable sets of positive integers and their decision problems (1944)
E1754074
UNEXPLORED
"Recursively enumerable sets of positive integers and their decision problems" (1944) is Emil Post’s landmark paper that helped found the theory of computability by analyzing algorithmically enumerable sets and the limits of effective decision procedures.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Recursively enumerable sets of positive integers and their decision problems (1944) canonical | 1 |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
Emil Post
→
notableWork
→
Recursively enumerable sets of positive integers and their decision problems (1944)
ⓘ