  In the mentioned paper we presented results of the estimation of Kolmogorov
complexity of sequences of random numbers generated in a famous Bell's
experiment, aimed to study the security of QKD. We focused on series of time
differences between successive detections of coincidences, and found that
randomness cannot be taken for granted. It was then criticized that the
theorems that demonstrate the randomness of series produced in Bell's
experiments involve series of measurement outcomes, not of measurement times.
Here we reply to this objection and present data of series of outcomes, showing
that the conclusions in the mentioned paper are valid also in this case.
