.
So if you wanted to patent all the combinations, you quickly run out of money. The USPTO charges thousands of dollars to process each application. If you wanted to patent the algorithm, the USPTO has a special kind of rejection for you. It is called "undue experimentation". In other words, you would have to perform a ridiculous amount of experimenting with unworkable and wrong combinations before you found one that works. In yet other words, no one is teaching you anything new by saying, "try a bunch of different combinations; one of them will work". Duh. Edison knew that, but he did the hard work of actually trying all the combinations, and finding the very few that worked. So, if the computer program isn't actually intelligent, it will waste a whole lot of resources attempting to patent useless crap.
.
TFA says that one company is copyrighting all possible 400 word combinations in the English language. That is 400 elements chosen from a set of around maybe 100,000 - 250,000 elements (English words). Since the words are allowed to repeat, taking the 100,000 figure, we have 100,000 raised to the 400th power, or 10^2400 possible combinations. Say the company had a very fast computer and was able to express and thereby claim 100 billion 400 word combinations per second. It would need just 10^2389 seconds to claim each combination. In very round numbers, a year is about 10^8 seconds, so the comany would need about 10^2381 years to complete it's task. In very round numbers, the lifetime of the universe is about 10^10 years, so the company would need about 10^2371 lifetimes of the universe to complete it's task. Or a faster computer. Or a new law that says that a person doesn't actually have to express something in order to copyright it.
Syntactic sugar causes cancer of the semicolon. -- Epigrams in Programming, ACM SIGPLAN Sept. 1982