From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: fac41,9a0ff0bffdf63657 X-Google-Attributes: gidfac41,public X-Google-Thread: 1108a1,9a0ff0bffdf63657 X-Google-Attributes: gid1108a1,public X-Google-Thread: 103376,4b06f8f15f01a568 X-Google-Attributes: gid103376,public X-Google-Thread: f43e6,9a0ff0bffdf63657 X-Google-Attributes: gidf43e6,public From: doylep@ecf.toronto.edu (Patrick Doyle) Subject: Re: Software landmines (loops) Date: 1998/09/03 Message-ID: #1/1 X-Deja-AN: 387549639 X-Nntp-Posting-Host: spark19.ecf Sender: news@ecf.toronto.edu (News Administrator) References: <35f51e53.48044143@ Organization: University of Toronto, Engineering Computing Facility Newsgroups: comp.lang.eiffel,comp.object,comp.software-eng,comp.lang.ada Date: 1998-09-03T00:00:00+00:00 List-Id: In article <35EDC648.76F03F32@draper.com>, Tim McDermott wrote: > >This seems a little extreme to me. While I have great respect for >combinatorial explosion, you are talking about a 3-term boolean expression. >There are only 6 ways to put one of those together, and I have no trouble >evaluating any of the forms. I know because I just listed them all, and ran >through their evaluation with no problem. Could you explain how you got the 6? If you want to talk about how many possible boolean expressions there are with n terms, that's 2^(2^n). There are 2^n assignments for the variables, and any combination of those assignments could make the expression true. If you're just talking about how many disjunctions there are, even that is 2^n because any combination of terms can be negated. Maybe what you're talking about is these?... A + B + C A & B + C A &(B + C) A + B & C (A + B)& C A & B & C However, these aren't really 6 distinct expressions. The third and fifth are the same, as are the second and fourth. -PD -- -- Patrick Doyle doylep@ecf.toronto.edu