107 citations · 174 across the 12 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.DS2014
Normality in non-integer bases and polynomial time randomness
Javier Almarza, Santiago Figueira
It is known that if is polynomial time random (i.e. no polynomial time computable martingale succeeds on the binary fractional expansion of ) then is normal in a…
quant-ph2014★ 31 cited
Algorithmic Pseudorandomness in Quantum Setups
Ariel Bendersky, Gonzalo de la Torre, Gabriel Senno +2
The Church-Turing thesis is one of the pillars of computer science; it postulates that every classical system has equivalent computability power to the so-called Turing machine. Wh…
math.LO2014
Algorithmic identification of probabilities is hard
Laurent Bienvenu, Santiago Figueira, Benoit Monin +1
Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter . By the law of large numbers, the frequency of zeros in the sequence…