Triple
T9062804
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Marcus Hutter |
E217168
|
entity |
| Predicate | researchInterest |
P3
|
FINISHED |
| Object |
Solomonoff induction
Solomonoff induction is a formal theory of universal prediction that combines algorithmic information theory and Bayesian reasoning to define an idealized, incomputable method for inferring future data from past observations.
|
E774592
|
NE FINISHED |
How this triple was built (4 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: Solomonoff induction | Statement: [Marcus Hutter, researchInterest, Solomonoff induction]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Solomonoff induction Context triple: [Marcus Hutter, researchInterest, Solomonoff induction]
-
A.
Kolmogorov complexity
Kolmogorov complexity is a measure of the amount of information in an object, defined as the length of the shortest computer program that can produce it.
-
B.
Bayesian Occam factor
The Bayesian Occam factor is a term in Bayesian model comparison that automatically penalizes overly complex models by integrating over their larger parameter spaces, thereby implementing Occam’s razor in probabilistic inference.
-
C.
minimum description length principle
The minimum description length principle is a formal method in statistics and machine learning that selects the best explanation for data as the one that yields the shortest overall description of both the model and the data it encodes.
-
D.
universal intelligence measure
The universal intelligence measure is a formal, mathematical framework proposed to quantify and compare the general intelligence of agents across all possible environments.
-
E.
Universal Intelligence: A Definition of Machine Intelligence
"Universal Intelligence: A Definition of Machine Intelligence" is a foundational paper by Shane Legg (with Marcus Hutter) that formally defines and mathematically characterizes general machine intelligence using concepts from algorithmic information theory and reinforcement learning.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Solomonoff induction Triple: [Marcus Hutter, researchInterest, Solomonoff induction]
Generated description
Solomonoff induction is a formal theory of universal prediction that combines algorithmic information theory and Bayesian reasoning to define an idealized, incomputable method for inferring future data from past observations.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Solomonoff induction Target entity description: Solomonoff induction is a formal theory of universal prediction that combines algorithmic information theory and Bayesian reasoning to define an idealized, incomputable method for inferring future data from past observations.
-
A.
Kolmogorov complexity
Kolmogorov complexity is a measure of the amount of information in an object, defined as the length of the shortest computer program that can produce it.
-
B.
Bayesian Occam factor
The Bayesian Occam factor is a term in Bayesian model comparison that automatically penalizes overly complex models by integrating over their larger parameter spaces, thereby implementing Occam’s razor in probabilistic inference.
-
C.
minimum description length principle
The minimum description length principle is a formal method in statistics and machine learning that selects the best explanation for data as the one that yields the shortest overall description of both the model and the data it encodes.
-
D.
universal intelligence measure
The universal intelligence measure is a formal, mathematical framework proposed to quantify and compare the general intelligence of agents across all possible environments.
-
E.
Universal Intelligence: A Definition of Machine Intelligence
"Universal Intelligence: A Definition of Machine Intelligence" is a foundational paper by Shane Legg (with Marcus Hutter) that formally defines and mathematically characterizes general machine intelligence using concepts from algorithmic information theory and reinforcement learning.
- F. None of above. chosen
Provenance (5 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_69ca83d4425481909a319dab847724ec |
completed | March 30, 2026, 2:08 p.m. |
| NER | Named-entity recognition | batch_69cc7ecd352c8190a744579209b2e535 |
completed | April 1, 2026, 2:11 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69cfebf4b9348190a7f01c64098c25f7 |
completed | April 3, 2026, 4:33 p.m. |
| NEDg | Description generation | batch_69cfedeb1a648190974b579109bdde3b |
completed | April 3, 2026, 4:42 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69cfee5ef8208190a129df4fa49037a0 |
completed | April 3, 2026, 4:44 p.m. |
Created at: March 30, 2026, 7:11 p.m.