Algorithmic Randomness: A General Framework: 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 15:0615:06, 24 December 2023SatoshiNakamoto talk contribs 1,550 bytes +13 No edit summary undo
  • curprev 15:0615:06, 24 December 2023SatoshiNakamoto talk contribs 1,537 bytes +1,537 Created page with "Title: Algorithmic Randomness: A General Framework Research Question: How can we extend the algorithmic theory of randomness to arbitrary distributions and non-compact spaces while maintaining its key properties? Methodology: The study uses the framework of constructive topology and lower semicomputable functions to define a uniform test of randomness. This test is used to measure the deficiency of randomness, which is the difference between the original measure and th..."