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@...
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@...
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@...
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@...
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@...
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@...
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@...
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@...
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@...
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@...
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@...
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@...
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@...
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@...
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@...
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@...
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@...
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 ...
80
Mok-Kong Shen
mok-kong.shen@...
Aug 10, 1998 8:27 am
... (At least previously) high-level system codes of Maple may be purchased. Thus one could in principle do some modifications. But I am ignorant of any system...
81
Vladimir Z. Nuri
vznuri@...
Aug 18, 1998 3:22 am
there is some pretty intense interest into quantum computing/theory recently. I consider the theoretical aspects of it reasonable for discussion here. if...
82
Stefan Bruda
bruda@...
Aug 18, 1998 5:56 pm
... Hi. I have recently investigated a little the domain, which seems to be pretty interesting, though we probably have to wait some time before a quantum ...
83
Vladimir Z. Nuri
vznuri@...
Aug 20, 1998 9:34 pm
we have a few new members from a recent post I made to newsgroups. I want to welcome everyone here, and as usual invite anyone to talk about your background, ...
84
Nico Benschop
benschop@...
Aug 22, 1998 5:34 pm
... Thanks for the welcome, Vladimir. Via sci.math I saw your note about this list, and it was recommended earlier to me for it's interesting topics &...
85
Vladimir Z. Nuri
vznuri@...
Aug 23, 1998 3:09 am
thanks for the post, Nico. welcome to the list; it's very rewarding to me to see someone with such great credentials willing to share some knowledge & words...
86
Nico Benschop
benschop@...
Aug 23, 1998 1:04 pm
... An automaton, or FSM (Finite State Machine) is a model of sequential behaviour - with a discrete set of inputs A (input alphabet), an internal state set Q,...
87
Nico Benschop
benschop@...
Aug 23, 1998 6:09 pm
... Re: <g> What I want, really, for designing optimal digital sequential logic circuits, is the maturity that is available (and taught at school) for an EE...
88
JDPeh@...
Aug 23, 1998 9:26 pm
Hi Nico! Thanks for the comprehensive introduction. I would like to know about finite semi-groups too, but 3 years of study is hard for me to do. Likewise I'm...
89
Nico Benschop
benschop@...
Aug 24, 1998 11:06 am
... It's all in my homepage ref[2] paper on "The structure of Constant- Rank State Machines" */c-ranksm.dvi If you have any questions, let me know;-) -- Ciao,...
90
Vladimir Z. Nuri
vznuri@...
Aug 24, 1998 9:56 pm
Nico-- I don't understand everything you're referring to but have a rough intuitive understanding of what you ... this almost sounds like you are referring to...
91
Vladimir Z. Nuri
vznuri@...
Aug 26, 1998 8:45 pm
this is a popular topic for the popular science-type magazines, the problem of trying to prove sphere-packing. it turns out that sphere packing has a lot to do...
