hi everybody, i m the new member of this group. -- India.com free e-mail - www.india.com. Check out our value-added Premium features, such as an extra 20MB for...
hi all, I have to go thru old archives here, am not caught up. a Q for you. this seems like it should be a very simple question to me, but I dont know an ...
Hi all! I'm looking for an english translation of a french phd thesis from 80 years ago; as you may imagine, this is not the easiest thing to find. :-)...
Hi All, I'm a new member in the group and hope to contribute in positive manner. Below is my brief CV Name - Janardan Mishrs (janmishra) Edu - Bachelor and...
Hi Vlad, ... Hmmmm, I've got a simple proof of this, but you are perhaps more interested in a complicated proof? I suppose what you mean is, don't prove a...
Hi everyone. Just want to wish you all success in the New Year and hope you all had a happy Holiday season. :) Also, while I'm at it, I'd like to welcome...
Hi Michael, It's nice to find someone with similar interests. Yes process algebras are very nice topic to learn and work upon. Recently I've been looking into...
Hi Kurt, You´ve touched the sensitive point : our good friend VZzz is death & blind... Friendly. Po;-))) Btw : Happy N-Y 2005, Lance! ... -- PôËt @:~?} ...
Hello all, this is a problem from Papadimitriou's COMPUTATIONAL COMPLEXITY: Problem 11.5.24 (c) Define nondeterministic Turing machines with advice. Prove that...
... think)!! ... C ... corresponding ... ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Ignore this. ... denote Sorry, C must be a polynomial size...
Ill be happy to see the simple proof. even if it is simple, I find it interesting that no textbook authors (I have heard of) explicitly prove it. its a good...
... Hello, To me, it seems you want to show that there are infinitely many O(n^2)-time algorithms with different input-to-output mappings. An algorithm that...
Hi Vlad, ... In computability and complexity theory, "algorithm" is generally taken to be synonymous with "Turing machine" (or some equivalent model of ...
hi guys, the trick is to try to find the zen behind the question. try not to think of it like an exercise like those in a textbook with an answer in the back....
Hi Vlad, ... Er, so when you ask a question, you're not actually looking for an answer to the question, but instead it's intended as a zen meditation? No right...
hi klve. all questions have an overt & a covert side. sort of like the iceberg thing. to make this more tangible re: the current topic, though, consider the...
... Of course there is no way to do find a bijection between surreal numbers (or, for that matter, real numbers) and languages. There is a countable number of...
... Sorry - I misread what you wrote. In any case, your point only seems important if a) TIME(n) = TIME(n log n), or the only languages decidable in O(n log...
Correct. For a non empty finite alphabet only the set of possible words/sentences is countably infinite not the set of languages, which is the power set of...
... Hi Cem. You're right about this. However, from vz's question and the subject of his post, it sounded to me like he was interested in the number of ...
Hello, Let me use some informal description below. According to my current understanding, you seek to find an infinite number of algorithms with the same time...
Gee, is it just me, or what? Could we have a little less STRIDENCY ("I'm right, and you're a jerk") and a little more MATURITY on this site? Could we climb...
Hi Keith, ... That's kind of funny, because I was just remarking to myself about how restrained the discourse has been on the recent 'algorithms' thread. In...
Hi Tony, ... ... but can you give a constructive proof of this? :) Seriously, though, you've got my curiosity aroused. How would you go about proving a "no...
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.
