Friday, March 28, 2003 The Berman-Hartmanis Isomorphism Conjecture http://www.fortnow.com/lance/complog/ Just thought I'd post this. It relates to some ideas...
If one were given the task of designing a graphical user interface (gui) to allow people to enter regular expressions, how would you design it? I will post in...
Myopic, over-reaching legislation has already claimed its first victim--LaBrea http://www.eweek.com/article2/0,3959,1032977,00.asp l8s, Mike N. Christoff...
That's an interesting point of view, shown in the article. If I understand it correctly, the authors claim, that computation is more than performing...
First off, Piotr, I have some things I'd like to say about adding interaction to the core model of computation. I think that theoretically it is not...
Some ideas for areas that might be interesting to look into. Extension of Turing machine model to accomodate interaction Structural Complexity Degrees of...
... Mike ==== Yes, both the article and its rebuttal raised intriguing issues. I thought this group may be interested in what I just posted in Lance Fortnow's...
... I did find this result in the Papadimitrou's book, but it was first proven by Mahaney in 1982. As far as I know the original proof is quite complicated....
They're trying to sue SPEWS??? Now THAT is funny! For those of you unaware SPEWS is a shadow organization. Very deliberately impossible to permanently locate. ...
Judge upholds law requiring ISPs to name downloaders http://www.idg.net/go.cgi?id=799689 BGP. The Internet was not built with security in mind; it was built...
... I agree with Michael here. Godel's incompleteness theorem in no way indicates that "logic cannot model mathematics". Consider the example of set theory....
... Yes in complexity theory there are reasons to consider other models. But when we want to talk only on computability then TM's are enough. However even...
Just an interesting post I read on whether unprovable statements are by default true. ... Okay, this is flame-bait, I am sure. I am a little ignorant of...
... Let me try to explain with the help of Euclidean (EG) and Non-Euclidean Geometry. Let G be the system that consists of all axioms of EG except parallel...
... From: piyush_kurur To: comp-sci-theory@yahoogroups.com Sent: Sunday, April 27, 2003 7:48 AM Subject: [comp-sci-theory] Re: Are unprovable statements...
<quote> Also, correct me if I'm wrong. Let I be an IM that can be represnted by a funtion f:R->R. Doesn't the halting problem imply that given an inrrational...
... That is right. The problem with ZF is that it is a First order theory. For first order theories either there is no model (in which case the theory is...
Monster pulls job listings, resumes for nations on U.S. sanctions list http://www.idg.net/go.cgi?id=799997 Project Lumos offers new anti-spam initiative ...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
