Jump to content

Talk:Computational irreducibility

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Miniquark (talk | contribs) at 03:33, 31 January 2024 (Suggest adding a section linking Computational Irreducibility to Algorithmic Information Theory). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

AND NOT A SINGLE CITATION WAS TO BE FOUND

Looks interesting, but "idea" in this context means original research which is not strictly proven, isn't it? — Preceding unsigned comment added by 37.214.42.7 (talk) 11:35, 20 June 2023 (UTC)[reply]

A fair observation, but - how does an Encyclopedia like Wikipedia handle a relatively novel idea like this one? Should Wikipedia discourage articles like this one because there aren't citations to back it up? It really is a ground-breaking concept that few others have pursued academically. To present a possible analogy from history - How would Galileo present his theory of a sun-centered universe? Steerpike5800 (talk) 02:55, 26 September 2023 (UTC)[reply]

Is Computational Irreducibility really such a novel idea? Back in 1974, Gregory Chaitin mathematically showed that most n bit strings are incompressible: in other words, the shortest program that can describe an n bit string is usually at least n bits long (another way to look at this is that most strings are algorithmically random, in the Kolmogorov sense). There's no possible shortcut: to describe most data, you have to go through each and every bit. It seems to me that Chaitin deserves at least a bit of credit here. IMHO, there should at least be a link to Algorithmic information theory and/or Kolmogorov complexity. Perhaps also an additional section discussing the connection, if an expert can contribute it? Any thoughts? --Miniquark (talk) 03:33, 31 January 2024 (UTC)[reply]