Triple
T1255211
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Church–Turing thesis |
E26972
|
entity |
| Predicate | relatesToConcept |
P531
|
FINISHED |
| Object |
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.
|
E143342
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a49487a9c48190ba9b05348fd1b53f |
elicitation | completed |
| NER | batch_69a4bfa5a4cc819093ed686619b572d8 |
ner | completed |
| NED1 | batch_69ac93cb76248190a23acb2e76ecfa8d |
ned_source_triple | completed |
| NED2 | batch_69ac952f74d48190b075919e0acd513d |
ned_description | completed |
| NEDg | batch_69ac9453f4488190a13ebabf3c8e07a5 |
nedg | completed |
Created at: March 1, 2026, 7:47 p.m.