[lojban] Re: How do I say "NP-complete"?

["Jorge Llambías" <lojban-out@lojban.org>]

On Dec 9, 2007 11:01 PM, Pierre Abbat <phma@phma.optus.nu> wrote:
>
> For "probabilistic" I
> could just say {cunso}, but "nondeterministic" I'm not so sure.

If {tolcu'o} is "deterministic", {naltolcu'o} would be "nondeterministic".

> For "polynomial" I came up with {tefsujme'o}.

But couldn't for example "e^x + e^-x" be a tefsujme'o too? {tenfa} has
"exponential" as keyword, even if it ca be used for integer powers too.

> "Complete" here does not have its usual meaning, so I don't think {mulno} is
> appropriate. It means that any other problem in NP can be converted into an
> instance of an NP-complete problem in polynomial time, so they are the
> hardest possible NP problems.

An NP-complete problem is a mulno problem in the sense that once solved,
all NP problems become mulno.

lo nu danfu lo me NP mulno nabmi cu mulri'a lo nu danfu ro me NP nabmi

> The last problem (hopefully) is how to translate a compound of an initialism
> and a word.

If you want a single "word": {N zei P zei mulno}.

I had a scheme to give rafsi to all cmavo at one point. I think it would have
given something like ny'ypy'ymulno, or perhaps {ny'yrpy'ymulno}, but I'd
have to check the details.

mu'o mi'e xorxes


To unsubscribe from this list, send mail to lojban-list-request@lojban.org
with the subject unsubscribe, or go to http://www.lojban.org/lsg2/, or if
you're really stuck, send mail to secretary@lojban.org for help.