Triple
T211710
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Alonzo Church |
E4733
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
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).
|
E26972
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a2575cb1dc8190a01ad332426dc339 |
elicitation | completed |
| NER | batch_69a25c2fd0648190bae9191a84129709 |
ner | completed |
| NED1 | batch_69a332cb28e08190a4e159b2631f5eb8 |
ned_source_triple | completed |
| NED2 | batch_69a333f5868c819083234c015ec243a5 |
ned_description | completed |
| NEDg | batch_69a333537ae481909f16bc4b37303d8c |
nedg | completed |
Created at: Feb. 28, 2026, 2:52 a.m.