Triple
T32282
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Chomsky hierarchy |
E644
|
entity |
| Predicate | correspondsToAutomatonModel |
P310
|
FINISHED |
| Object |
Turing machine
A Turing machine is an abstract computational model that manipulates symbols on an infinite tape according to a set of rules, providing a formal foundation for the concept of algorithm and computability.
|
E2505
|
NE FINISHED |
Provenance (6 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a2479dec388190967ba648663442c9 |
elicitation | completed |
| NER | batch_69a249ec0d288190ac3a0939db61813b |
ner | completed |
| NED1 | batch_69a24e5ec6308190ad27b8b28b3f59d2 |
ned_source_triple | completed |
| NED2 | batch_69a2512bd888819097e930e961f5fffa |
ned_description | completed |
| NEDg | batch_69a250c9b7388190a997ec073d9d0500 |
nedg | completed |
| PD | batch_69a24870417081909c7c01e400c94716 |
pd | completed |
Created at: Feb. 28, 2026, 1:44 a.m.