... At the end of the paper he spends one sentence claiming his approach has been tested on real students with success. I would like to see the data supporting...
As a recap, here is an article by Peter Wegner stating that his Interaction machines are super-Turing. http://citeseer.nj.nec.com/wegner97interactive.html Here...
Question: Would the readers of comp-sci-theory be interested in getting news items on IT Outsourcing? Let me know. Squeezing light from nanotubes Researchers...
Unexpected Insights from Data Mining Sometimes the results from data analysis are just plain absurd. Web logs show that one of the most common search phrases...
Microsoft trains staff in Linux and Java Microsoft is training around 140 of its consultants in Linux and Java, acknowledging the growing threat posed by these...
I've been having a discussion with one Ben Tels about whether any model of computation that can recognize a non-context-sensitive language is by default...
House approves $2.4 billion for nanotech research http://www.techinformer.com/go.cgi?id=801894 Finger pressure patterns provide recognition Users can be...
Finger pressure patterns provide recognition Users can be recognized by characteristics of tapping on film http://www.techinformer.com/go.cgi?id=801894 ...
Hi ... There seems to be a definitional issue here as I understand it. In a certain trivial sense, Tels' statement is false. I can start with a computation ...
... I understand that LBA is a "linear bounded automata" -- a machine that can recognize context languages (at least as my lecture in automata theory says -- I...
Firstly, it does not make sense to say that a model that accepts a particular language say L can recognise all recursive language. The only thing that makes...
... From: Piotr Faliszewski To: comp-sci-theory@yahoogroups.com Sent: Tuesday, May 13, 2003 2:41 AM Subject: Re: [comp-sci-theory] Turing-complete by default? ...
I read your post. Very interesting. Best explanation of degrees of computability I have read so far. Firstly, it does not make sense to say that a model that...
Maximum Google Learn about all Google's extra search features. 6 pages of google tips. http://www.idg.net/go.cgi?id=802577 Blogs play a role in homeland...
Well probably I didnot get the meaning of what you said : What I meant is the following: A model of computation that accepts a class of language can be a ...
Hi, I just joined this list. I am sorry if this posting is irrelevant. I majored in CS when taking my undergraduate degree. I am planning to take my master...
Just a quick note. My harddrive has irrecoverably crashed! My PC was a 2 year old Dell, and the hdd dies! So much for getting a name- brand PC. Anyways,...
Hello out there, may I introduce myself a bit. My name is Ralf Klueber and I work for Vodafone D2 in Germany. Vodafone is one of the world's largest mobile ...
Glad to see your post in the archives :) ... be a ... how ... The concerns you have most likely stem from ambiguities in my original post. I didn't mean to...
... Here you are actually looking at the Turing degree of A. { more explicitly consider the turing reductions that make one query to the oracle. Think of this...
Hi, SV_RFID (http://groups.yahoo.com/group/sv_rfid/) is a Yahoo group that aims to gather together those who have common interest in RFID, not only as just a...
This is just a summary of some discussions I've been having on other groups. The first question that arose was whether NP-complete implied 'requires...
Hi everyone: I just began study theory of computation,now I read the chaper5 of Reducibility of sipser's book, but I cann't understand the proof of theorem...
... From: drewqin To: comp-sci-theory@yahoogroups.com Sent: Tuesday, June 03, 2003 9:26 AM Subject: [comp-sci-theory] puzzled by regular language recognition...
... thank you further explanation, now I think I basicly undertand the idea of the proof. but can we change the definition of M_2 into below: Construct the...
... From: Klaus D. Witzel To: comp-sci-theory@yahoogroups.com Sent: Tuesday, June 03, 2003 4:30 AM Subject: [comp-sci-theory] Re: Closing in on NP and...
... From: drewqin To: comp-sci-theory@yahoogroups.com Sent: Wednesday, June 04, 2003 5:48 AM Subject: [comp-sci-theory] Re: puzzled by regular language...
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.
