A Good and SIMPLE Measure of Randomness

by

Your question answers itself. “If I were to pass the first 100,000 digits of Pi to the function, it should give a number very close to 1”, except the digits of Pi are not random numbers so if your algorithm does not recognise a very specific sequence as being non-random then it’s not very good.

The problem here is there are many types of non random-ness:-
eg. “121,351,991,7898651,12398469018461” or “33,27,99,3000,63,231” or even “14297141600464,14344872783104,819534228736,3490442496” are definitely not random.

I think what you need to do is identify the aspects of randomness that are important to you-
distribution, distribution of digits, lack of common factors, the expected number of primes, Fibonacci and other “special” numbers etc. etc.

PS. The Quick and Dirty (and very effective) test of randomness does the file end up roughly the same size after you gzip it.

More Related Contents:

  1. Unique (non-repeating) random numbers in O(1)?
  2. Expand a random range from 1–5 to 1–7
  3. Is there an efficient way to generate N random integers in a range that have a given sum or average?
  4. What distribution do you get from this broken random shuffle?
  5. Select k random elements from a list whose elements have weights
  6. Data structures for loaded dice?
  7. Pseudorandom Number Generator – Exponential Distribution
  8. Choosing n numbers with fixed sum
  9. Shuffle list, ensuring that no item remains in same position
  10. True random number generator [closed]
  11. Create a random permutation of 1..N in constant space
  12. Creating a random number generator from a coin toss
  13. Given a number, produce another random number that is the same every time and distinct from all other results
  14. Random points inside a parallelogram
  15. Reservoir sampling
  16. Generating shuffled range using a PRNG rather than shuffling
  17. Randomly choosing from a list with weighted probabilities
  18. Unbiased random number generator using a biased one
  19. What is stability in sorting algorithms and why is it important?
  20. Equation for testing if a point is inside a circle
  21. How to find list of possible words from a letter matrix [Boggle Solver]
  22. Is it possible to express “t” variable from Cubic Bezier Curve equation?
  23. find all subsets that sum to a particular value
  24. What is Constant Amortized Time?
  25. How can I compute a Cartesian product iteratively?
  26. Quicksort: Iterative or Recursive
  27. Polygon enclosing a set of points
  28. Algorithm to mix sound
  29. Retrieving the top 100 numbers from one hundred million of numbers [duplicate]
  30. What is password hashing? [closed]

Leave a Comment