Terry Reedy tjreedy at home.com
Tue Sep 11 16:02:49 EDT 2001

• Previous message (by thread): Proposed PEP for a Conditional Expression
• Next message (by thread): Proposed PEP for a Conditional Expression
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

<thp at cs.ucr.edu> wrote in message news:9nkvss$cmq$1 at glue.ucr.edu...
> :           WORKAROUND_2: (this SOMETIMES works)
> :              > x = c and a or b

> The problem of determining whether or not a given expression ever
> evaluates to false is equivalent to determining whether a given
Turing
> machine halts, i.e., the general case is not algorithmically
solvable.

True, but so what?  Most real examples seem to involve constants that
are triviallly either true or false or simple expressions that are
trivial to decide in context.

Terry J. Reedy

---

• Previous message (by thread): Proposed PEP for a Conditional Expression
• Next message (by thread): Proposed PEP for a Conditional Expression
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

More information about the Python-list mailing list