Sorry, I don't have any paper suggestions, however I was wondering if you've heard of a website called 'google' ( www.google.com ). Google is what is known as...
Refining the wonderful suggestion, may I recommend an astounding addition to the wonders of "search engine" named 'google'. Voila: scholar.google.com...
That is a very good site - thanks for tip. PS: ... plz help, need help answering theez 10 questions - send answers fast fast fast!!!!! send ansrs as soon as u...
ouch that gotta heart (remark the gotta ;) ) ... From: Michael N. Christoff To: comp-sci-theory@yahoogroups.com Sent: Saturday, August 06, 2005 9:06 PM ...
Hi everyone. Just thought I'd let you all know that I've designed a custom image for the Computer Science Theory home page and have slightly changed the intro...
... Well, I recognize von Neumann, Alan.Turing, Babbage's "Difference Engine," and what looks like the "Colossus" perhaps? Keith Alexander P.S. If we're...
... All your answers are correct except for the last one, which is ENIAC. Not bad. ... I wouldn't say we're abandoning Sipser, but we haven't been going...
hello friends i am saravanan from tamil nadu india i am engineering(computer sciece) gradute working in a software company i am so interested in theory of...
... From: comp-sci-theory@yahoogroups.com [mailto:comp-sci-theory@yahoogroups.com]On Behalf Of saravanan_1084 Sent: Friday, August 12, 2005 5:36 AM To:...
What about the astronaut, the chip (is it the intel 404?) and the binary superstructure in the new cover page? Are they not part of the collage quiz? ...
Hi Srinivas. I'm not sure what type of chip is in the collage, the binary thing is just a cool picture from a textbook I believe, and the 'astronaut' is...
When you take two units to the left (of P_0 series) and one unit up (of the P_1 series) you never reach point b. You reach some other point in space and...
... I forgot to include that the distance moved up at a time in graph P_n should also be d_n. But this is reflected in the formula for m_n. m_n = 6 * 2^n, so...
One can define complexity classes from Turing machines and from uniform circuit famalies. If P_T is the class of languages efficiently recognized by Turing ...
... Hello, I think all three answers are "yes". Let me take P_T vs. P_C for example. Consider the tableau method used in the proof of the Cook-Levin theorem....
Hi everyone, After being away from it for a while, I'm back to studying theoretical computer science. I decided that this time around, I'd try using a blog as...
As a Lego fan i encountered this document proposal about lego brick connectors: http://www.ldraw.org/OLD/reference/specs/lcd/ The problem for me is nothing is...
Hi all. In my ongoing research into distributed computing, I have started to focus more on distributed complexity vs computability. Papers focused on...
thats really bring u a good fortune man keep going ... __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the...
Thanks for the vote of confidence sir. I didn't realize Prime Minister Paul Martin read comp-sci-theory :-] -mike ... From: comp-sci-theory@yahoogroups.com...
Hello everyone, I am new to the group and need some help. I am presently doing my under-graduate course in computer science (final year), and I am supposed to...
hi vivek i suggest you to work on Computational Logic wich has direct practical applications and it is a open subject yet. this is a very good resource for...
Hi folks, My name is Henry Chou. I'm current a CS graduate student in the University of Florida. Our formal languages and computation theory course uses...
Hello, How goes the proof that the time hierarchy theorem relativizes for any oracle? can anyone give an example of a proof that doesn't relativize? thanks...
... There are indeed proofs that don't relativize. I remember that there is a result stating that MA is included in PP whereas this is not the case under some...
... proof ... The time hierarchy theorem relativizes. :) ... for any ... there is ... the case ... not dig ... relativize! ... oracles ... be ... result) ... ...
I want to show that it is undecidable to determine whether a Turing machine halts on an input word that has an even number of symbols. Here is what I did: ...
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.
