Triple
T30446439
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | AIXI |
E774590
|
entity |
| Predicate | computabilityStatus |
P91856
|
FINISHED |
| Object | uncomputable |
—
|
LITERAL 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: uncomputable | Statement: [AIXI, computabilityStatus, uncomputable]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: computabilityStatus Context triple: [AIXI, computabilityStatus, uncomputable]
-
A.
computabilityRequirement
Indicates that something must be capable of being computed or effectively carried out by an algorithm or computational process.
-
B.
complexityStatus
Indicates the current level or state of complexity associated with an entity or process.
-
C.
turingComplete
Indicates that a system or language is capable of performing any computation that a universal Turing machine can, given enough time and memory.
-
D.
decidability
chosen
Indicates whether a given problem, property, or statement can be algorithmically determined to be true or false for all possible inputs.
-
E.
isNPComplete
Indicates that a decision problem is both in NP and NP-hard, meaning it can be verified in polynomial time and is at least as hard as any problem in NP.
- F. None of above.
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_69f22493ef9c8190ae8c2afcb7f994c8 |
completed | April 29, 2026, 3:32 p.m. |
| NER | Named-entity recognition | batch_69f686bf793081908803f8fca4e00e39 |
completed | May 2, 2026, 11:20 p.m. |
| PD | Predicate disambiguation | batch_69f678d2196c8190b9d0d2fcd47cc539 |
completed | May 2, 2026, 10:21 p.m. |
Created at: April 29, 2026, 8:08 p.m.