Oliver wrote: ) "Googmeister" <firstname.lastname@example.org> wrote in message ) news:email@example.com... )> Formally, a decision problem is a subset of strings over some alphabet, )> say the binary alphabet. There are uncountably many such subsets. ) ) Couldn't you list all the binary strings of length 1, then of length 2, ) then of length 3 and so on, thus iterating over all binary strings and thus ) all decision problems?
A decision problem isn't a binary string, it's a specific subset of all the binary strings.
) Or equivalently, assuming that an decision problem can always be ) described in English (e.g. using an alphabet of 26 characters, 10 digits, ) and some punctuation), couldn't you iterate over every possible ASCII ) sequence and thus "count" the decision problems?
Well that's the point. You can only describe a tiny fraction of all decision problems in English.
SaSW, Willem -- Disclaimer: I am in no way responsible for any of the statements made in the above text. For all I know I might be drugged or something.. No I'm not paranoid. You all think I'm paranoid, don't you ! #EOT