From: "Andrei Sabelfeld" <spam@...> Subject: PhD Positions at Chalmers Date: Tue, 08 Feb 2000 13:24:12 +0100 To: "comp.theory@..."...
1084
Vladimir Z. Nuri
vznuri@...
Apr 7, 2000 4:56 am
From: "John Marshall" <john@...> Subject: Webneurons. A new way of programming computers. Date: Sat, 26 Feb 2000 02:07:43 +0000 To:...
1085
qoy80@...
Apr 10, 2000 5:03 am
Substantially increase your Business Profits! Would your business explode if you could accept credit cards? 99% of all Internet Transactions last year were in...
1086
Dan Pehoushek
danpehous@...
Apr 16, 2000 5:36 pm
Yeah, that sounds plausible. An "active" intelligence on the internet. The problem I see with all this comm technology, is that its "taken" over our lives in...
1087
Dan Pehoushek
danpehous@...
Apr 19, 2000 1:37 pm
Thanks Angelo. Sorry about the post. Its a strange thing, when I sit unprepared, and post something, some "personal control" is lost, and I end up looking...
1088
ex120sqn@...
Apr 19, 2000 2:21 pm
I've checked this out. It CAN be true that any even number can be the sum of two prime numbers, but not necessarily so. E.g: 34 subtract 7 = 27 27 is NOT a...
1089
Stas Busygin
busygin@...
Apr 19, 2000 2:49 pm
Hello All! ... of ... It asserts the existance of two primes whose sum is the given odd number. It does not mean that you must obtain a prime if you subtract...
1090
Rogerio Brito
rbrito@...
Apr 19, 2000 7:15 pm
... Hey, Doctor, First, it's not a theorem. It's a conjecture that has not yet been proved, but that people believe is true. Second, it states that for every...
1091
adall@...
Apr 19, 2000 7:32 pm
Hi, ... What is ... Before you all get excited, I have no concrete method yet - I was discussing what possibilities are open if such a proof is found with Dan....
1092
Stas Busygin
busygin@...
Apr 20, 2000 8:54 am
... Well, I was going to learn mpeg principles many times but still I've not done this. Could you explain which transformation do you mean? Besides, some links...
1093
adall@...
Apr 20, 2000 5:41 pm
Hi, I know this is a bit off the topic of this list, but read on... Basically the transformation MPEG uses is called DCT - discrete cosine transform - there...
1094
Mark Stab
mstab@...
Apr 21, 2000 4:45 pm
I wonder what Klaus might have to say on this. Higher "dimension" to the logic? Bring it home guys! Wrong dimension, maybe, almost certianly, but what about...
1095
adall@...
Apr 21, 2000 7:50 pm
Well - about considering ALL dimensions at once - it is obviously impossible to do - there are an infinite number of logical systems, like there can be an...
1096
superryan@...
Apr 23, 2000 4:29 am
In a message dated 4/19/2000 3:40:52 pm Eastern Daylight Time, ... Actually, I'd say more research in computer science is based on the assumption that P != NP,...
1097
Anukool Lakhina
anukool@...
Apr 23, 2000 5:38 am
... Sounds interesting. Wouldn't step 4 above require the new logical system to be reducible to the "normal" logic system. Perhaps I don't understnad what you...
1098
adall@...
Apr 23, 2000 5:43 pm
Yes, Ryan, you're right - unfortunately the majority of people working on computational complexity and related fields have assumed that P != NP - which is...
1099
superryan@...
Apr 24, 2000 1:46 am
In a message dated 4/23/2000 1:46:06 pm Eastern Daylight Time, ... If you mean to say there is no proof, well, you are right. But of course there is...
1100
Klaus D. Witzel
kwitzel@...
Apr 25, 2000 2:37 pm
... From: "Mark Stab" <mstab@...> To: <theory-edge@egroups.com> Sent: Friday, April 21, 2000 18:39 Subject: RE: [theory-edge] Re:...
1101
adall@...
Apr 25, 2000 4:52 pm
... and ... IMHO that ... This is of course undisputably true - what I'm saying is that for the purposes of the P=NP? question, there may be some alternative...
1102
Vladimir Z. Nuri
vznuri@...
Apr 26, 2000 12:29 am
hi everyone. it's great to see some activity on the list. I haven't checked it in ages and its neat to see some familiar "faces" so to speak. angello:...
1103
Vladimir Z. Nuri
vznuri@...
Apr 26, 2000 12:50 am
ok, I might be losing my mind, and having a dan-type moment, or just a little off. but.. this weekend I went back and looked at a very cool proof in intro to...
1104
Jeffrey Considine
jconsidi@...
Apr 26, 2000 1:46 am
... Since you bring this up again, here are some thoughts I've had on this since you last posted on this subject... For some version of this TM, it is easy to ...
1105
Kathrin Paschen
paschen@...
Apr 26, 2000 7:04 am
... vladimir> 1. given an input R that denotes a regular language with vladimir> alphabet E, determine whether R = E* (all vladimir> strings in the language)--...
1106
Klaus D. Witzel
kwitzel@...
Apr 26, 2000 10:56 am
... From: <adall@...> To: <theory-edge@egroups.com> Sent: Tuesday, April 25, 2000 18:50 Subject: [theory-edge] Re: time&space&P&NP... ... Fully agreed!...
1107
David Lantsman
davidlan@...
Apr 26, 2000 1:11 pm
... Interesting thoughts Vlad :). I looked up the problems in Garey/Johnson book, and haven't found something like the above problem. But giving this problem...
1108
Mati Tombak
mati@...
Apr 26, 2000 3:16 pm
... It seems to me, that the complement of the poblem in in NP: GUESS x \in E^n CHECK if x is not in L(R) then accept. I did not find any completeness result...
1109
Vladimir Z. Nuri
vznuri@...
Apr 26, 2000 5:35 pm
... .. ... I disagree with this or would like to clarify. from what I understand anukool was saying, he is talking about converting the abstract problem of...
1110
Vladimir Z. Nuri
vznuri@...
Apr 26, 2000 5:42 pm
... there is a simple inductive proof that a+b==b+a always holds for naturals. if the TM is written right, it never halts. QED. my research plan is a bit more...
1111
Vladimir Z. Nuri
vznuri@...
Apr 26, 2000 5:45 pm
... I need a limit on n and forgot to mention this. let there be a polynomial P such that n<P(|R|) where |R| is the amount of space required to encode the...
1112
Jeffrey Considine
jconsidi@...
Apr 26, 2000 5:49 pm
... The problem with this is that just deciding whether an arbitrary TM calculates a+b is undecidable. jef...
