The Randomness Deficiency Function and the Shift Operator

09/08/2023
by   Samuel Epstein, et al.
0

Almost surely, the difference between the randomness deficiencies of two infinite sequences will be unbounded with respect to repeated iterations of the shift operator.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/26/2019

On the monotone complexity of the shift operator

We show that the complexity of minimal monotone circuits implementing a ...
research
05/08/2018

Coordination Using Individually Shared Randomness

Two processors output correlated sequences using the help of a coordinat...
research
11/14/2017

Barrel Shifter Physical Unclonable Function Based Encryption

Physical Unclonable Functions (PUFs) are circuits designed to extract ph...
research
08/08/2020

Quantum algorithmic randomness

Quantum Martin-Löf randomness (q-MLR) for infinite qubit sequences was i...
research
09/11/2018

Shift-Inequivalent Decimations of the Sidelnikov-Lempel-Cohn-Eastman Sequences

We consider the problem of finding maximal sets of shift-inequivalent de...
research
08/04/2019

Detecting the Hot Hand: Tests of Randomness Against Streaky Alternatives in Bernoulli Sequences

We consider the problem of testing for randomness against streaky altern...
research
06/13/2019

Characteristic Power Series of Graph Limits

In this note, we show how to obtain a "characteristic power series" of g...

Please sign up or login with your details

Forgot password? Click here to reset