Leonid A. Levin's Research on Incompleteness and Kolmogorov Complexity: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 04:2104:21, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,048 bytes +2,048‎ Created page with "Title: Leonid A. Levin's Research on Incompleteness and Kolmogorov Complexity Abstract: Leonid A. Levin, a renowned computer scientist, proposed a solution to a loophole in Gödel's Incompleteness Theorem. He suggested that extending the universal partial recursive predicate (or Peano Arithmetic) would either leave an input unresolved or contain nearly all information about an input's n-bit prefix. Levin argued that creating significant information about a specific math..."
Retrieved from "https://simplesci.org/wiki/Leonid_A._Levin%27s_Research_on_Incompleteness_and_Kolmogorov_Complexity"