Talk:Solomonoff's theory of inductive inference

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Mathematics This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics ??? This article has not yet received a rating on the project's priority scale.

Shouldn't this entry be titled 'universal inductive inference', since there are many more models of inductive inference than the Solomonoff/AIT model? --Johnny Logic 05:54, 8 January 2006 (UTC)[reply]

Have created a redirect from Identification by next value. Someone knowledgable on inductive inference could useful expand this article to include information on different techniques. QuiteUnusual 13:07, 7 October 2006 (UTC)[reply]

This article is nowhere near meeting minimum Wikipedia quality standards. In particular, the section entitled "Modern applications" is appalling. TheSeven (talk) 09:57, 22 May 2014 (UTC)[reply]

Is there a way to add a clarification needed tag to an entire article? EDIT: just found out about the {{clarity}} tag. GreatBigDot (talk) 20:45, 13 June 2017 (UTC)[reply]

Why does the Turing Machine section have a warning about no citations? Every other sentence ends with a citation in parens! TravellerDMT-07 (talk) 00:18, 5 October 2019 (UTC)[reply]

The article makes the statement, in the subsection titled 'Solomonoff's Uncomputability', that "[...] he showed that computability and completeness are mutually exclusive: any complete theory must be uncomputable." This gives the impression that Solomonoff discovered this property of computable logic; which is both misleading and false. It was Godel that first discovered this property with his incompleteness theorems. A link should be made between this statement and Godel's findings in order to avoid misrepresenting Solomonoff as the discoverer of this property of finite logic. — Preceding unsigned comment added by 86.30.111.102 (talk) 15:00, 21 March 2021 (UTC)[reply]

Completely unrelated to Goedel's theorem. In that case, logical systems that include arithmentic can't be simultaneously consistent or complete. consistent != computatble. Also, the definition of completeness in the two cases is different. The proof is also structurally different. There is no arithmetization is Solomonoff's, which is more similar to the proof of incomputability of the halting problem (an adversarial construction). I think you are overreacting to the shared word "completeness". — Preceding unsigned comment added by A1957 (talk • contribs) 18:55, 5 November 2021 (UTC)[reply]