Prev: EINSTEIN'S ABUSE OF TIME
Next: NP+complete-problem navigation, search In computational complexity theory, the complexity class NP-complete (abbreviated NP-C or NPC), is a class of problems having two properties: * It is in the set of NP (nondeterministic polynomial time) pr
From: Wolf K on 22 Jul 2010 21:31
On 22/07/2010 17:40, K_h wrote:
[...]>
> Accepted axioms are assertions that are observed to be true and cannot be reduced
> to anything simpler.[...]

"Observed" is the wrong word here.

wolf k.
From: Don Stockbauer on 23 Jul 2010 08:26
On Jul 22, 8:31 pm, Wolf K <weki...(a)sympatico.ca> wrote:
> On 22/07/2010 17:40, K_h wrote:
> [...]>
>
> > Accepted axioms are assertions that are observed to be true and cannot be reduced
> > to anything simpler.[...]
>
> "Observed" is the wrong word here.
>
> wolf k.

Infinity gets me......excited.
From: Inverse 19 mathematics on 23 Jul 2010 08:48
On Jul 23, 7:26 am, Don Stockbauer <donstockba...(a)hotmail.com> wrote:
> On Jul 22, 8:31 pm, Wolf K <weki...(a)sympatico.ca> wrote:
>
> > On 22/07/2010 17:40, K_h wrote:
> > [...]>
>
> > > Accepted axioms are assertions that are observed to be true and cannot be reduced
> > > to anything simpler.[...]
>
> > "Observed" is the wrong word here.
>
> > wolf k.
>
> Infinity gets me......excited.

PLEASE PLEASE , We have proven that the K constant for divergence
of numbers is .001(000.-1=0.001) . It is obvious that numbers etc
diverge at 1:3 (Tan 19), and since the inverse point is fixed that
divetgence would ultimately lead to reversaal of the inverse curve.
all math calculations originate in a fixed point, whilst the
divergence is not fixed , so mathematically the inverse point must
must move relatively nearer to the plane of divergence ultimately to
exceed that plane it into a reverse curved relationship-- THAT POINT
IS THE EDGE OF INFINITY AND WILL BE A VERY LOUD BOOM

Hope Research

http://hoperesearch.web.officelive.com/default.aspx
From: K_h on 23 Jul 2010 16:15

"Wolf K" <wekirch(a)sympatico.ca> wrote in message
news:Jh62o.5585$fY2.5431(a)unlimited.newshosting.com...
> On 22/07/2010 17:40, K_h wrote:
> [...]>
>> Accepted axioms are assertions that are observed to be true and cannot be
>> reduced
>> to anything simpler.[...]
>
> "Observed" is the wrong word here.

No, it is not.

_


From: Wolf K on 23 Jul 2010 20:16
On 23/07/2010 16:15, K_h wrote:
> "Wolf K"<wekirch(a)sympatico.ca> wrote in message
> news:Jh62o.5585$fY2.5431(a)unlimited.newshosting.com...
>> On 22/07/2010 17:40, K_h wrote:
>> [...]>
>>> Accepted axioms are assertions that are observed to be true and cannot be
>>> reduced
>>> to anything simpler.[...]
>>
>> "Observed" is the wrong word here.
>
> No, it is not.
>
> _
>
>


I read "observe" in its usual empirical sense. Apparently you don't. So
what do you mean by "observe"?

cheers,
wolf k.
First  |  Prev  | 
Pages: 14 15 16 17 18 19 20 21 22 23 24
Prev: EINSTEIN'S ABUSE OF TIME
Next: NP+complete-problem navigation, search In computational complexity theory, the complexity class NP-complete (abbreviated NP-C or NPC), is a class of problems having two properties: * It is in the set of NP (nondeterministic polynomial time) pr