Triple
T10055361
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Ackermann function |
E208846
|
entity |
| Predicate | relatedConcept |
P37
|
FINISHED |
| Object | Turing computability |
E173643
|
NE FINISHED |
How this triple was built (2 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Turing computability | Statement: [Ackermann function, relatedConcept, Turing computability]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Turing computability Context triple: [Ackermann function, relatedConcept, Turing computability]
-
A.
Computability Theory
chosen
Computability Theory is a branch of theoretical computer science and mathematical logic that studies which problems can be solved by algorithms and how efficiently they can be computed.
-
B.
Turing degrees
Turing degrees are an abstract classification of sets of natural numbers or decision problems according to their relative level of algorithmic unsolvability or computational complexity under Turing reducibility.
-
C.
Turing reducibility
Turing reducibility is a central computability-theoretic notion that compares the relative computational difficulty of decision problems by allowing one problem to be solved using an oracle for another.
-
D.
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).
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69ca836094408190a36a1ea7e9a86fcd |
completed | March 30, 2026, 2:06 p.m. |
| NER | Named-entity recognition | batch_69cdcfacacd08190abe66f8bb17b92c7 |
completed | April 2, 2026, 2:08 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d29a49cb208190b56d991a523efbac |
completed | April 5, 2026, 5:22 p.m. |
Created at: March 30, 2026, 8:57 p.m.