Re: on 2^O(lg n) being a polynomial

From	Ben Bacarisse <ben.usenet@bsb.me.uk>
Newsgroups	comp.programming
Subject	Re: on 2^O(lg n) being a polynomial
Date	2017-03-29 14:12 +0100
Organization	A noiseless patient Spider
Message-ID	<87inmsut09.fsf@bsb.me.uk> (permalink)
References	<86lgrudu6c.fsf@toledo.com> <87vaqtwn2a.fsf@bsb.me.uk> <86vaqtasm5.fsf@toledo.com>

Show all headers | View raw

Daniel Bastos <dbastos@toledo.com> writes:

> Ben Bacarisse <ben.usenet@bsb.me.uk> writes:
>> Daniel Bastos <dbastos@toledo.com> writes:
>>
>>> Here's an argument to prove that 2^O(lg n) is a polynomial.
>>
>> You are tripping up over your terminology.  2^O(lg n) is a set of
>> functions ans do can't be polynomial.  You can't even say that the
>
> What was supposed to be written here?  ``ans do''?  If this is latin, I
> need help.  I assumed it was a typo, but can't fix it myself.

"and so".  The d and s got swapped.  I think you got the other points
which were the important ones.

<snip>
-- 
Ben.

Back to comp.programming | Previous | Next — Previous in thread | Find similar | Unroll thread

Thread

on 2^O(lg n) being a polynomial Daniel Bastos <dbastos@toledo.com> - 2017-03-24 22:25 -0300
  Re: on 2^O(lg n) being a polynomial Kaz Kylheku <336-986-7787@kylheku.com> - 2017-03-25 02:39 +0000
  Re: on 2^O(lg n) being a polynomial Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-28 14:25 +0100
    Re: on 2^O(lg n) being a polynomial Kaz Kylheku <336-986-7787@kylheku.com> - 2017-03-28 17:45 +0000
    Re: on 2^O(lg n) being a polynomial Daniel Bastos <dbastos@toledo.com> - 2017-03-28 20:28 -0300
      Re: on 2^O(lg n) being a polynomial Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-29 14:12 +0100

csiph-web