Skip to main content
2 votes

How can I estimate the time and cost (in relation to the machine and vocabulary) to enumerate sentences of English of n words?

If you want to do some estimation, what could be possible is counting bit operations. On a modern computer, one can expect to do roughly $10^9$ bit operations per second (depending on the processor, ...
Nathaniel's user avatar
  • 15.8k
1 vote
Accepted

Enumerating proper intersections

Yes. If there is any $C$ that works, then taking $C = c(i)$ works [*]. It is easy to compute $c(i)$ and then check if it satisfies your definition. Better yet, the following is a simpler ...
D.W.'s user avatar
  • 161k
1 vote
Accepted

Looking for all "valid" combinations taken from a set of things, where subsets of "valid" things are always "valid"

This can be formulated as finding all minimal subsets for a monotone function. Here monotone captures your property about supersets and subsets. Or, this can be formulated exact interactive learning ...
D.W.'s user avatar
  • 161k

Only top scored, non community-wiki answers of a minimum length are eligible