On the computability of Solomonoff induction and knowledge-seeking (Q2835643)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the computability of Solomonoff induction and knowledge-seeking |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computability of Solomonoff induction and knowledge-seeking |
scientific article |
Statements
On the Computability of Solomonoff Induction and Knowledge-Seeking (English)
0 references
30 November 2016
0 references
Solomonoff induction
0 references
exploration
0 references
knowledge-seeking agents
0 references
general reinforcement learning
0 references
asymptotic optimality
0 references
computability
0 references
complexity
0 references
arithmetical hierarchy
0 references
universal Turing machine
0 references
AIXI
0 references
BayesExp
0 references
0 references
0.9087241888046264
0 references
0.7801769971847534
0 references
0.7591114044189453
0 references
0.7530444264411926
0 references
0.7480547428131104
0 references
