Re: Computational complexity, number theory tidbits
From: David C. Ullrich (ullrich_at_math.okstate.edu)
Date: 08/02/04
- Next message: tchow_at_lsa.umich.edu: "Simple synthetic proof of an "obvious" geometric theorem?"
- Previous message: Laserman: "Re: A dead subject"
- In reply to: David Kastrup: "Re: Computational complexity, number theory tidbits"
- Next in thread: Jürgen R.: "Re: Computational complexity, number theory tidbits"
- Messages sorted by: [ date ] [ thread ]
Date: Mon, 02 Aug 2004 16:06:24 -0500
On 02 Aug 2004 16:38:28 +0200, David Kastrup <dak@gnu.org> wrote:
>jstevh@msn.com (James Harris) writes:
>
>> [...]
>
>Look, it is trivial that
>
>[...]
>Similarly, it is trivial that
>
>[...]
>So it is quite trivial that
so your point is that james should write another paper
on his latest discovery, eh?
i mean really, a discovery that's so basic that anyone
with half a brain can prove it in a few minutes must be
a lot more important than that stuff you see in journals
where you need a friggin degree just to be able to -read-
the thing!
[which of course is not intended to say you have half
a brain...]
************************
David C. Ullrich
sorry about the inelegant formatting - typing
one-handed for a few weeks...
- Next message: tchow_at_lsa.umich.edu: "Simple synthetic proof of an "obvious" geometric theorem?"
- Previous message: Laserman: "Re: A dead subject"
- In reply to: David Kastrup: "Re: Computational complexity, number theory tidbits"
- Next in thread: Jürgen R.: "Re: Computational complexity, number theory tidbits"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
