Skip to search.
theory-edge · cutting edge in algorithmics/mathematics

Group Information

  • Members: 1238
  • Category: Algorithms
  • Founded: May 19, 1998
  • Language: English
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Hear how Yahoo! Groups has changed the lives of others. Take me there.

Messages

  Messages Help
Advanced
Messages 50 - 79 of 14634   Oldest  |  < Older  |  Newer >  |  Newest
Messages: Simplify | Expand   (Group by Topic) Author Sort by Date ^
50 Vladimir Z. Nuri
vznuri@... Send Email
Jul 6, 1998
3:25 am
hello; hope everyone is enjoying their summer so far. happy 4th to everyone in the US. one author I consider very interesting and the source of some very...
51 JDPeh@... Send Email Jul 20, 1998
12:15 pm
Hi theory edge readers and writers! Just grinding my pspace axe, because my np axe breaks when I grind it :) ... actually p=np may be 'more important' than...
52 Vladimir Z. Nuri
vznuri@... Send Email
Jul 22, 1998
2:45 am
hi JDP and everyone else-- either P==NP, or P!=NP. either result is very interesting. the problem can certainly be studied regardless of Pspace results. now, I...
53 JDPeh@... Send Email Jul 22, 1998
6:37 am
... I think so, too. ... Well, pspace isn't new, just been ignored. And the top level NP problems (like tautology, or satisfiability) are existential merely ...
54 Vladimir Z. Nuri
vznuri@... Send Email
Jul 22, 1998
6:47 pm
... hmmm, I don't think it has been ignored. there's a lot of pretty good results on it even in the 70's. now you could say it has less interest than p?=np,...
55 Conrad Eaton
ceaton@... Send Email
Jul 23, 1998
3:08 am
I note that the original request for contributions to this group mentioned Goldbach's conjecture, in which I have some interest. Recently there have been a...
56 Jpr2718@... Send Email Jul 23, 1998
10:55 pm
In a message dated 98-07-23 00:06:33 EDT, Conrad Eaton wrote: << A somewhat more restrictive conjecture is that there is always a prime, p, between the ...
57 Vladimir Z. Nuri
vznuri@... Send Email
Jul 24, 1998
3:35 am
regarding primes, I once wrote an essay in which I considered the idea that modern awareness of chaos is in fact somewhat ancient. the irregular distribution ...
58 Dan Pehoushek
jdpeh@... Send Email
Jul 25, 1998
3:26 am
Just to let folks know, the library is up and going. They are putting together a decent collection of benchmark problems and solvers. Although I personally...
59 Stefan Bruda
bruda@... Send Email
Jul 25, 1998
6:27 pm
Hi all. ... Just wandering through my collection of papers: Has anyone any idea about analog shift maps? They are claimed as highly chaotic dynamical systems...
60 Vladimir Z. Nuri
vznuri@... Send Email
Jul 26, 1998
2:24 am
... haven't read about "shift maps", but my (ignorant) guess is that this might be related to shift register type encryption codes. apparently there is a lot...
61 Personal - Erols
answers@... Send Email
Jul 26, 1998
2:42 am
... From: Vladimir Z. Nuri [mailto:vznuri@...] Sent: Saturday, July 25, 1998 10:24 PM To: theory-edge@... Cc: vznuri@... ...
62 Vladimir Z. Nuri
vznuri@... Send Email
Aug 5, 1998
1:04 am
hi, I have been busy working on a physics paper lately, hope everyone's research is going well. I thought I would mention mathematica 3.0, which I found very ...
63 Vladimir Z. Nuri
vznuri@... Send Email
Aug 5, 1998
12:12 am
ok, I am toying with forwarding some articles from comp.theory to this list. here's some new software.. ... From: Minopt Software Support...
64 Mok-Kong Shen
mok-kong.shen@... Send Email
Aug 5, 1998
11:52 am
... Weighting on all aspects I tend also to give Mathematica the highest score. There are lots of programs for different applications written in Mathematica...
65 Vladimir Z. Nuri
vznuri@... Send Email
Aug 5, 1998
8:47 pm
yes, the free software movement has really taken off. one way to look at it as a sort of economy in which people trade labor by trading software. in other...
66 Conrad Eaton
ceaton@... Send Email
Aug 6, 1998
1:49 am
... What do you all think is the best package for symbolic math? I have Mathcad, and am very impressed, but I am a real neophyte at this, and am very naive. ...
67 Mok-Kong Shen
mok-kong.shen@... Send Email
Aug 6, 1998
11:18 am
... My experience with these is negligibly small. Macsyma is the first really extensive CA system. It is probably aged now in some sense but I guess that the...
68 Mok-Kong Shen
mok-kong.shen@... Send Email
Aug 6, 1998
11:30 am
... There could be no exact answer to your question. It is like which is the best car or TV-set or who is the most beautiful girl. Mathcad has a good name but...
69 JDPeh@... Send Email Aug 6, 1998
5:56 pm
... I'm not in disagreement, and I have not used such CA systems. For critical problems, the more checking, the better. However, not to start a big argument...
70 Vladimir Z. Nuri
vznuri@... Send Email
Aug 6, 1998
10:19 pm
I haven't been able to figure this question out. consider some kind of "limited halting problem" in which we don't try to solve all cases, only limited...
71 JDPeh@... Send Email Aug 7, 1998
2:13 am
... Well, I don't mean to trivialize, but the finite version of many problems is "theoretically" very trivial, as they essentially reduce to propositional...
72 Mok-Kong Shen
mok-kong.shen@... Send Email
Aug 7, 1998
11:21 am
... Unfortunately what you seriously doubted is true. You can do checks with the same system, say you differentiate an integral etc. In some systems you can...
73 Stefan Bruda
bruda@... Send Email
Aug 7, 1998
12:36 pm
... Hi. It seems to me that your language is RE. Let the language "M halts on input x of length n in s(n) steps" be L. Then, one can build a machine M1 that ...
74 Lars Kristiansen
larskri@... Send Email
Aug 7, 1998
4:21 pm
... Nonsense. The language is non-r.e. The complement language the set of M such that there exists an input x such that M does not halt in s(the length of x)...
75 Stefan Bruda
bruda@... Send Email
Aug 7, 1998
8:39 pm
... Hi. Sorry, I simplified the problem by mistake, missing the phrase "for all inputs" from the original post. Still, it is not clear for me why this is not...
76 Vladimir Z. Nuri
vznuri@... Send Email
Aug 8, 1998
4:09 am
JDP: your point about reducing problems to propositional logic is well taken. one of my favorite examples is the following. consider any complicated algebraic ...
77 Vladimir Z. Nuri
vznuri@... Send Email
Aug 8, 1998
4:17 am
MKS helped me out with the acronym, "CA" as "computer algebra". I consider this a very misleading term for Mathematica. it is definitely symbolic, but the ...
78 Vladimir Z. Nuri
vznuri@... Send Email
Aug 8, 1998
4:31 am
hi Stefan, glad to see your enthusiasm.... as I recall, you were the one who posted the reference to the set of papers that might have proved that the non re...
79 Stefan Bruda
bruda@... Send Email
Aug 8, 1998
9:15 pm
... Hi. Well, I did posted those references (actually it was something like CS=RE), but I hoped one will find the error in one of the papers rather than prove ...
Messages 50 - 79 of 14634   Oldest  |  < Older  |  Newer >  |  Newest
Add to My Yahoo!      XML What's This?

Copyright © 2010 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines NEW - Help