Leonid A. Levin's Research on Incompleteness Theorems 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:2004:20, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,415 bytes +2,415‎ Created page with "Title: Leonid A. Levin's Research on Incompleteness Theorems and Kolmogorov Complexity Abstract: Leonid A. Levin, a renowned computer scientist, proposed a solution to a loophole in Gödel's Incompleteness Theorems. His research involved extending the universal partial recursive predicate (or Peano Arithmetic) and proving that any such extension either leaves an n-bit input unresolved or contains nearly all information about the n-bit prefix of any recursively enumerabl..."
Retrieved from "https://simplesci.org/wiki/Leonid_A._Levin%27s_Research_on_Incompleteness_Theorems_and_Kolmogorov_Complexity"