permutations

The number of permutations for what people in just one user's network like and dislike is staggering.

When you have software that runs on 23% of the web, it is simply impossible to test for all permutations.

The only way to get equal precision via enumeration is to fully enumerate all the permutations.

So many thinkings are just permutations of what has already been heard, and they form patterns and it's really weird.

Company blog post claims 480 times more permutations[1] are harder to crack then 4 digit passcodes.

Add permutations of the above files filled with all zeros 0x00 and all ones 0xFF.

There are infinitely many permutations of string theory, all of which are mathematically potentially valid.

Remember the emotions that you feel were generated via random permutations of your genetic code.

Possessive quantifiers are a way to prevent the regex engine from trying all permutations.

Did you still see a necessity for functional tests that test all permutations diligently?

It's hard to write all the permutations, but in practise it's pretty easy.

Regular expressions are a compact way of precisely describing an enumeration of permutations.

As a draft, its name was various permutations on "sslv3-diediedie".

In the Tivo example, pretend you wanted users to be able to go up to the device and say "only record shows where one of the lexicographical permutations of the length in minutes is a prime number." The only way to avoid it is not to avoid it: to create a user-extension language with its own compiler, and a VM embedded into the program.