Triple
T3995391
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Entscheidungsproblem |
E87086
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | problem in computability theory |
C7254
|
CONCEPT FINISHED |
How this triple was built (1 step)
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.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: problem in computability theory Context triple: [Entscheidungsproblem, instanceOf, problem in computability theory]
-
A.
model of computation
A model of computation is an abstract mathematical framework that defines how algorithms are represented and executed, specifying the rules, operations, and resources available for performing computations.
-
B.
foundational principle in theoretical computer science
A foundational principle in theoretical computer science is a core, abstract concept or rule—such as computability, complexity, or formal language theory—that underlies and unifies the study of algorithms, computation models, and their inherent limits.
-
C.
mathematical problem
chosen
A mathematical problem is a question or task that requires the application of mathematical concepts, methods, or reasoning to find a solution or demonstrate a result.
-
D.
problem in invariant theory
A problem in invariant theory concerns determining and characterizing the algebraic functions (invariants) that remain unchanged under the action of a given group on a vector space or algebraic variety.
-
E.
collection of unsolved mathematical problems
A collection of unsolved mathematical problems is a curated set of open questions in mathematics that have been precisely formulated but lack known proofs or solutions.
- F. None of above.
Provenance (1 batch)
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_69aed94118148190975e6aa4e554cde9 |
completed | March 9, 2026, 2:29 p.m. |
Created at: March 9, 2026, 3:34 p.m.