Theory
in [Programming]
|
Calls for Papers: International Conference on Communications Systems and Technologies (ICCST 2008) Calls for Papers: International Conference on Communications Systems and Technologies (ICCST 2008) From: International Association of Engineers (IAENG) San Francisco, USA, 22-24 October, 2008 http://www.iaeng.org/WCECS2008/ICCST2008.html The conference ICCST'08 is held under the World Congress on Engineering 20... 7 May 2008 07:28
Questions on turing machine problems 1) I'm trying to understand the following problem: let M_1 and M_2 two turing machines with common input alphabet and a given string x. Is there a particular step in which the two machines will write the same symbol on the tape? is it undecidable? can somebody give an idea on how can we reduce this problem to an... 6 May 2008 23:26
QuickSort (worst-cases... special data) I've got a problem with QuickSort's analysis. The worst-case complexity is O(n^2) and in my analys I have data generated in that way... I think it is called A-shape and Vshape sequences... Making it clearly it looks like that: i have array : 2,4,6,8,10,9,7,5,3 - A shaped and Vshaped - 9,7,5,3,1,2,4,6,8 In theo... 6 May 2008 23:26
Another approach to decide on existence of a real root for Univariate Polynomials with Integer Coefficients, and a possible Multivariate extension for 3-SAT To give an example, for the bivariate case, consider Q(x1,x2) = (x1-1)^2 + (0.01)^2 + (x2)^2. Now when Q(x1,0) = (x1-1)^2 + (0.01)^2, we will need a univariate Polynomial U, which when multiplied with Q(x1,0), will yield a univariate Polynomial with positive real coefficients. Now, when Q(x1,sqrt(0.9999)) = (x1-... 6 May 2008 22:23
Questions on turing machine problems polymedes wrote: 1) I'm trying to understand the following problem: let M_1 and M_2 two turing machines with common input alphabet and a given string x. Is there a particular step in which the two machines will write the same symbol on the tape? These TMs will probably write the same symbol on the tape... 6 May 2008 23:26
domains for typed lambda calculi Michal Przybylek <mrp(a)neostrada.pl> wrote: JohnF <john(a)please.see.sig.for.email.com> wrote: That's exactly what I was looking for. If so (i.e. if you are really interested in categorical models), then I strongly suggest you to read "An introduction to fibrations, topos theory, the effective ... 7 May 2008 10:08
Proving a Language Is Not a CFL This is a problem from Sipser's book which I'm unable to answer: If A is a CFL and B is a regular language, then the intersection of A and B is context free. Given this result, show that the language C = {w : w in {a, b, c}* and contains an equal number of a's, b's and c's} is not a CFL. Let D be the language ... 6 May 2008 22:23
2d cross-correlation / convolution Dear all, I'm not sure if this is the right place for this so if not sorry. I'm trying to get a 2D matrix correlated with a reference matrix. I've been told I need to do this with convolution. I have the convolution down but now i have a complex number that I don't know how to convert back to a real numb... 7 May 2008 03:31
Call for Papers: International Conference on Computational Biology ICCB 2008 Call for Papers: International Conference on Computational Biology ICCB 2008 From: International Association of Engineers (IAENG) San Francisco, USA, 22-24 October, 2008 http://www.iaeng.org/WCECS2008/ICCB2008.html The conference ICCB'08 is held under the World Congress on Engineering and Computer Science 2... 24 Apr 2008 13:27
PhD studentships at Liverpool, UK Applications are invited for PhD positions at the Department of Computer Science of the University of Liverpool, UK. The Department has funds to support three PhD studentships to begin on or around September 2008, and to run for 3 to 4 years. Further details are at: http://www.csc.liv.ac.uk/~pwg/2008-stu... 24 Apr 2008 05:15 |