The Randomness Deficiency Function and the Shift Operator
Samuel Epstein

TL;DR
This paper investigates how the measure of randomness deficiency between two infinite sequences behaves under repeated shifts, showing that their difference can grow without bound.
Contribution
It introduces the concept that the difference in randomness deficiencies can become unbounded through shift iterations, advancing understanding of sequence randomness.
Findings
Difference in randomness deficiencies can be unbounded
Shift operator impacts sequence randomness measures
Almost sure divergence under repeated shifts
Abstract
Almost surely, the difference between the randomness deficiencies of two infinite sequences will be unbounded with respect to repeated iterations of the shift operator.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · advanced mathematical theories · Mathematical Dynamics and Fractals
