hello, how is everyone? if there are new members to the list, feel free to introduce yourself. it's always great to hear the backgrounds of anyone signing up....
968
Vladimir Z. Nuri
vznuri@...
Dec 12, 1999 5:16 am
I've posted quite a few ideas/brainstroms on possible routes to proving P vs. NP. here are some recent ideas I've been toying with. I wonder if there is some...
969
Vladimir Z. Nuri
vznuri@...
Dec 12, 1999 5:16 am
From: "Steve Stevenson" <steve@...> Subject: NP-complete and information in the problems Date: 29 Nov 1999 13:35:16 -0500 To:...
970
Vladimir Z. Nuri
vznuri@...
Dec 12, 1999 5:16 am
From: "W.K. van Dam" <wimvdam@...> Subject: Quantum Computation article available Date: Fri, 3 Dec 1999 14:26:47 GMT To: "comp.theory@..."...
971
Vladimir Z. Nuri
vznuri@...
Dec 12, 1999 5:16 am
From: "Samir Khuller" <samir@...> Subject: WORKSHOP ON APPROXIMATION ALGORITHMS (SEP 2000) Date: 4 Dec 1999 11:37:25 -0500 To:...
972
David Lantsman
davidlan@...
Dec 12, 1999 11:10 am
Hi Vladimir and everyone on this list! I've posted several messages here, but as far as I remember, the first one I posted when I just encountered this list,...
973
William Haloupek
william.haloupek@...
Dec 12, 1999 5:33 pm
... Hi Group, My name is Bill Haloupek. My background: PhD (complex analysis), U of Wisconsin-Madison, 1992 Assistant Professor, U of Wisconsin-Stout,...
974
George Herbert
gherbert@...
Dec 12, 1999 7:04 pm
... Hello all! My name is George Herbert. I have a masters in Computer Science from the University of North Florida. I am currently a systems specialist for...
975
Martyn Amos
M.Amos@...
Dec 12, 1999 7:23 pm
Preliminary Announcement: 16th British Colloquium for Theoretical Computer Science BCTCS 16, April 10-12 2000, Liverpool, UK The 16th annual British Colloquium...
976
George Herbert
gherbert@...
Dec 12, 1999 8:09 pm
... Obviously, any "naive" attempt to make a non-deterministic problem deterministic will in general lead to an exponential implementation (i.e. not P). A...
977
Klaus D. Witzel
kwitzel@...
Dec 13, 1999 9:18 am
How is everybody, long time no see! On Sunday, December 12, 1999 06:19, Vladimir Z. Nuri <vznuri@...> ... Sort of dejavue for me: I'm currently...
978
d p
danpeh@...
Dec 14, 1999 3:28 pm
... Ditto! Im in europe right now, and email is just a little difficult... they charge by the 10 minutes, :(... Anyway, my opinion should be well known by...
979
Claude Chaunier
claude@...
Dec 14, 1999 5:28 pm
... Good, I sometimes think that P!=NP, that it's out of our current reach, and that we shall soon prove it so, i.e. to be undecidable in our current systems. ...
980
Ilya Shlyakhter
ilya_shl@...
Dec 14, 1999 5:56 pm
Hello everyone, I'm looking for pointers on the following question: Is there a published formal analysis of the first-fail variable selection heuristic, i.e....
981
members-services@...
Dec 20, 1999 7:34 pm
The KitKat Club is an award-winning, ultra-hardcore private club. We want to offer you a 3 day trial. You'll have full and unrestricted access to all of our ...
982
Vladimir Z. Nuri
vznuri@...
Dec 22, 1999 6:26 am
happy holidays to everyone on the list. thanks to all who have contributed over the past year. thanks to the various new members for posting some personal...
983
Vladimir Z. Nuri
vznuri@...
Dec 22, 1999 7:08 am
my holiday present to all the members of this list!! due to the miracle of cyberspace, I just built and uploaded the graph depicting the boolean logic...
984
Lin Gu
lingu@...
Dec 22, 1999 7:32 am
I think every proposition is decidable, including P=NP. In complexity theory, 'Decidability' is to say whether we'll have a Turing Machine that halt on every...
985
Allan Tabilog
ranjit_ramanujan@...
Dec 22, 1999 7:48 am
... Hi! My name is Allan Martinez Tabilog. I have a degree in physics from the Univ. of the Philippines and I'm currently finishing my M.Sc. on computer...
986
SuperRyan@...
Dec 22, 1999 11:42 pm
... on ... I don't understand why you assert this. Suppose I give you an arbitrary TM M_i and say "Does M_i halt on blank tape?" The answer is true or false ...
987
George Herbert
gherbert@...
Dec 23, 1999 6:10 am
My comments below: ... Kurt Goedel clearly established that there are undecidable problems in any system powerful enough to axiomatize arithmetic. Only...
988
Vladimir Z. Nuri
vznuri@...
Dec 23, 1999 6:17 am
from an article on spy recruiting in the US.. an interesting little factoid. Source: Los Angeles Times ...
989
Klaus D. Witzel
kwitzel@...
Dec 23, 1999 8:30 am
... If you extend the meaning of decidable: yes, of course! ... No: an _arbitrary_ Turing Machine that halts on _arbitrary_ input and then reports the correct...
990
Mikhail Adigeyev
madi@...
Dec 23, 1999 8:59 am
Hello! ... I'm not an expert in the theory of decidability, but as far as I remember, the term 'decidable' is referred to mass problems, that is to problems...
991
Lin Gu
lingu@...
Dec 24, 1999 3:16 am
... From: "Klaus D. Witzel" <kwitzel@...> To: <theory-edge@egroups.com> Sent: Thursday, December 23, 1999 4:33 PM Subject: [theory-edge] Re: musings on P...
992
Lin Gu
lingu@...
Dec 24, 1999 3:22 am
... From: <SuperRyan@...> To: <theory-edge@egroups.com> Sent: Thursday, December 23, 1999 7:42 AM Subject: [theory-edge] Re: musings on P vs. NP ... Turing...
993
Lin Gu
lingu@...
Dec 24, 1999 3:53 am
... From: "George Herbert" <gherbert@...> To: <theory-edge@egroups.com> Sent: Thursday, December 23, 1999 11:40 AM Subject: [theory-edge] Re: musings on...
994
Klaus D. Witzel
kwitzel@...
Dec 24, 1999 9:34 am
From: Lin Gu <lingu@...> To: <theory-edge@egroups.com> Sent: Friday, December 24, 1999 04:17 Subject: [theory-edge] Re: musings on P vs. NP ... ...
995
SuperRyan@...
Dec 24, 1999 8:18 pm
... study ... I for one would like some elaboration on this. If you're claiming the proof of the Halting problem's undecidability is somehow faulty, then I'd...
996
Jeffrey Considine
jconsidi@...
Dec 24, 1999 10:07 pm
... If you can solve the halting problem, you can write a total computable function g such that g(g) = not g(g). This is the contradiction... jef...
