Can any one solve this problem? let C be the class of all decision problems that are polynomial time Turing redicible to some language L in (NP intersection...
Dear all, I recently realized that BTC (one of the problems I have been studying) is a generalization of the Disjoint Paths Problem. The reduction is actually...
hi! I am a undergraduate student. I need some help for my work. I have to develop a ANN program in c/c++ that will take say about 10 numeric parameters and...
If it is a function approximation problem, try using GRNN (General Regression Neural Network) which as you would be knowing is a kind of Radial Basis Neural...
I think you can solve it on two steps: Firsly, prove that C is subset from (NP intersection CoNP) Secondly, prove that ((NP intersections CoNP) difference C) =...
Hi, The problem with your solution is that you seem to assume that we are talking about many-one reductions, while the problem regards Turing reductions. Thus,...
hi all here is a sort of interesting but weird reduction that Id like to discuss with anyone. I may have mentioned some related ideas on this list at one pt. ...
Hi Vlad, ... It's been a long time since I've looked at HU79 (actually, it's been a long time since I've looked at any complexity theory), so I can't resist. ...
hi, This is kool ....try this link http://www.raxdev.com/?r=68EAFE37 Regards ks ... How low will we go? Check out Yahoo! Messenger’s low PC-to-Phone call...
hi, this is my first message! i'm a first year student in CS and here its my question: can anyone prove that the number of binary trees with n nodes, b_{n}, ...
... Look at the root of the tree. The left subtree contains k nodes, the right subtree n-k-1. (You subtract 1 for the root itself). So the number of possible...
that's the Catalan number.. as you said, let b_n = # of binary trees on n nodes... pick a node (the root).. split the remaining n-1 nodes into two groups: the ...
... think I ... to ... The answer of this problem is in the below paper: Herman A. Maurer. A direct proof of the inherent ambiguity of a simple context-free...
hi, i'm looking for bibliographical references to Group Theory applications in Theoretical CS. I've just found Epstein's "Word Processing in Groups", and i...
... Have a look under computational group theory. The new book by Derek Holt "Handbook of computational group theory" is useful. Also have a look under...
Nimish Shah
Nimish_Shah@...
Jul 6, 2006 8:04 am
2354
Carlo, You may like to have a look at semi-groups and inverse semi-groups (generalization of groups). MV Lawson's work discusses their links with TCS. 1)MV...
Hi Kim, I did some research on the computational power of recurrent neural networks and investigated a proof by a Finnish professor who proved that every...
Omid Do you know if the reverse question has been attacked? I.e, is there anything that a neural network can do that cannot be expressed in algoritmic form? ...
Well, actually I've investigated the question and I don't know about any formal proof but as far as I believe every program running on a simple recurrent...
Strictly speaking, any finite-memory computer can only accept a subset of regular languages (not even all of them). If one ignores memory, then showing that a...
This question can be rephrased as "Is there a neural network that can not be simulated by a computer with arbitrarily large memory?" and the answer looks very...
Cem That was exactly what I was seeing, with the same "unless maybe". Given 'sensitive depedency on initial conditions' the fact that reals are in the mix does...
hi.... m a std of software eng ... n hav an assignment ... i hav to rite doen n explain full description of network ... how it works... specially the server...
This is a somewhat off-topic request. On this email list we typically scream at people for asking other to solve theory question rather than networking...
... Yes. Strange like an infinite precision real number. ... From: comp-sci-theory@yahoogroups.com [mailto:comp-sci-theory@yahoogroups.com] On Behalf Of...
Hi every body, There is a problem I have exposed to but, though being badly in need of an answer, I have not yet been able to solve it. I am not quite sure if...
Hello, ... If I understood the problem statement correctly, the answer is simply p = C(k, n-1) + r. Idea why this should be the right answer -- take arbitrary...
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.
