Re: Boolean expression sought for
- From: "xadrezus" <xadrezus@xxxxxxxxx>
- Date: 8 Jun 2005 06:23:23 -0700
Hi, Ken:
Ken posted:
>
>Wouldn't this work: name 9 logical 'variables':
> a b c d e f g h i
> and form this:
>
> (a & !b & !c & !d & !e & !f & !g & !h & !i) v
> (!a & b & !c & !d & !e & !f & !g & !h & !i) v
> (!a & !b & c & !d & !e & !f & !g & !h & !i) v
> (!a & !b & !c & d & !e & !f & !g & !h & !i) v
> ...
> (!a & !b & !c & !d & !e & !f & !g & !h & i)
Thanks for your help. Your expression would work,
it's more or less the same I obtained from the truth
table. The problem is it requires a lot of operations,
namely 72 ANDs, 72 NOTs and 8 ORs, for a total of
152 boolean operations to get the result.
While this would be tolerable, as all booleans
are optimized assembly-language operations, I was hoping
that some simplifications could be found or an entirely
different boolean expression, so that the operation count
(right now 152 in all) would be reduced significantly.
I do have a hunch, namely that using XORs in some
clever way, and not only ANDs, ORs, and NOTs, would
probably afford the sought for reduction, but right now
I've been unable to find the right combination.
Thanks again and best regards.
.
- Follow-Ups:
- Re: Boolean expression sought for
- From: Ken Quirici
- Re: Boolean expression sought for
- References:
- Boolean expression sought for
- From: xadrezus
- Re: Boolean expression sought for
- From: Ken Quirici
- Boolean expression sought for
- Prev by Date: Re: [OT] Right Books (was re: Excuses, Excuses)
- Next by Date: Re: FOL, ZFC, NGB and Prolog
- Previous by thread: Re: Boolean expression sought for
- Next by thread: Re: Boolean expression sought for
- Index(es):
Relevant Pages
|