Vlad wrote: [...snip...] ... The (proof of) the halting problem claims that such TM's do not exist. I'd infer that then the language cannot exist, rather than...
721
Martyn Amos
martyn@...
Jun 1, 1999 11:09 am
... Ed Regis, "Who Got Einstein's Office? Eccentricity and Genius at the Princeton Institute for Advanced Study", Penguin, ISBN 0 14 01.4923 6 Well worth a...
722
Vladimir Z. Nuri
vznuri@...
Jun 1, 1999 7:07 pm
artificial intelligence, a fascinating topic. however I don't think the charter for this list supports a "philosophical" discussion of it. there are good...
723
SuperRyan@...
Jun 2, 1999 3:16 am
... Don't mean to pick nits, but the definition is circular. "Intelligence" is some means of creating a mapping in an "intelligent" way? This statement is ...
724
Tony Aponick
taponick@...
Jun 2, 1999 5:46 am
A lot of thought has gone into the subject of 'deep' AI. Not the run of the mill neural net or genetic algorithm / programming, but the question posed here:...
725
busygin@...
Jun 2, 1999 2:55 pm
Hi All, Because of two recent claims on a polynomial algorithm for HCP I'd like to know something more about the place of HCP in NPC class. I mean that I'm...
726
Vladimir Z. Nuri
vznuri@...
Jun 2, 1999 6:12 pm
superryan: to the extent my idea is circular, I am not claiming it is an explanation. its just a start on a formal way of looking at AI. the idea is basically...
727
adall@...
Jun 2, 1999 7:22 pm
Hi Stas, and all, I've been inactive for quite a while - been working hard ! The recent discussion about HCP has interested me a lot - claims to a polynomial...
728
Vladimir Z. Nuri
vznuri@...
Jun 3, 1999 12:07 am
I was musing on my "mapping adjustment function" idea in the last message, and have another point of view. perhaps the simultaneous objective of the "mapping...
729
busygin@...
Jun 3, 1999 7:21 am
... There is no problem to convert HCP (as well as any other of NP) to boolean logic -- I completely understand how to use it as a universal NP language. But...
730
Mati Tombak
mati@...
Jun 3, 1999 8:10 am
... Hi, Stas The reduction you asked for can be found in C. K. Yap, "Theory of Complexity Classes", ch. 3. ...
731
busygin@...
Jun 3, 1999 1:37 pm
Hi Mati, ... Thanks a lot, that is exactly what I was looking for. Besides, the book is a recent and well written text on complexity theory available online....
732
Vladimir Z. Nuri
vznuri@...
Jun 3, 1999 5:48 pm
... yeah, this looks very interesting. one of the first online books that I know of on the subject of complexity. let's all take a look. comments anyone? how...
733
Derik Hawley.
dhawley@...
Jun 3, 1999 6:10 pm
Hi... ... A post script viewer for most platforms is available through the site, http://www.cs.wisc.edu/~ghost/aladdin/get550.html It is about 10 Megs in size....
734
d p
danpeh@...
Jun 4, 1999 6:04 am
... A very simple method to test HCPs is to generate random 3-regular graphs, and check them for hamiltonicity. "Almost all" (in a technical graph theoretic...
735
busygin@...
Jun 4, 1999 12:06 pm
Hi Dan, and All, I've tried WLO's HCP solver ( http://www.wlo.net/HCP.htm ) on large regular graphs and they are fairly easy for it. To provide the opportunity...
736
Anatoly D. Plotnikov
aplot@...
Jun 4, 1999 3:48 pm
Hello everyone, ... ... Thank you. Now, I have an EXPERIMENTAL program for HCP. It checks correctness of an idea. The given variant of the program runs with...
737
Derik Hawley.
dhawley@...
Jun 4, 1999 6:52 pm
Hello, One way to test Hamiltonian Cycle Solvers is with grid graphs. A grid graph is a square lattice like a go board, though it can be of higher...
738
Vladimir Z. Nuri
vznuri@...
Jun 4, 1999 6:54 pm
(this exchange is pretty neat. thanks for posting the code Stas. thanks for trying it Anatoly..) anatoly: try posting the results for experiments up to several...
739
Anatoly D. Plotnikov
aplot@...
Jun 4, 1999 9:38 pm
Hello Derik, ... It is a very interesting graph class. Do you know something about hamiltonicity of triangular grid? ... I think that it is a worthy theme to...
740
adall@...
Jun 4, 1999 9:59 pm
Hi Anatoly, all, I have found an interesting paper entitled, "A Polynomial Algorithm for the Hamiltonian Cycle Problem in Semicomplete Multipartite Digraphs",...
741
d p
danpeh@...
Jun 5, 1999 12:26 am
Those are good times for small graphs, Anatoly. As far as I can recall, for random 3-regular graphs, the time for programs I looked at was exponential in the...
742
Klaus D. Witzel
kWitzel@...
Jun 7, 1999 7:11 am
Dan, in some of your posting you refer to resolution wrt SAT input. Could you detail the conditions for me, e.g. given two clauses c1,c2, and when do you stop...
743
Jeff Brown
kludge@...
Jun 7, 1999 9:00 am
[argh: This is the fourth time I send this... my mailer seems to be crapping out for no reason near the end of the message, it's on the server side, that much...
744
Vladimir Z. Nuri
vznuri@...
Jun 8, 1999 3:33 am
... From: Bernard Moret <moret@...> Newsgroups: comp.theory Subject: ALENEX 00, First Call for Papers Date: 20 May 1999 07:39:17 -0600 CALL FOR PAPERS ...
745
busygin@...
Jun 9, 1999 11:17 am
Hi All, I have now a converter for maximal clique problem to HCP. It gave the first found instance refuting the WLO claim on polynomial HCP solving -- their...
746
Jeff Brown
kludge@...
Jun 13, 1999 5:59 am
Did I say something wrong, or have I singlehandedly killed this thread? If so, I apologize! Jeff. ... eGroups.com home:...
747
Anatoly D. Plotnikov
aplot@...
Jun 13, 1999 12:39 pm
Hello everyone, ... Thus, a research and a business are incompatible. Methods for successful business are unfit for researches. Besides, a few questions arise....
748
busygin@...
Jun 14, 1999 8:33 am
Hi All, ... I wonder if WLO made any money on HCP solver. Perhaps their invention on laser is really profitable but I don't see any reason to pay them $1200...
749
Anatoly D. Plotnikov
aplot@...
Jun 14, 1999 7:58 pm
Hello everyone, ... Categorical judgements do not are always inherent to truth... I think that we understand the different concept of a random generator. This...
