Author: ignougroup

Problem Detail: In distributed systems theory, I have found the definition that a distributed system requires, among others, location and access transparency. I was wondering if location transparency does not already include access transparency. Wikipedia defines the two as follows: Access Read More …

Problem Detail: Given a list of numbers as L, how do you find the minimum value m such that L can be made into a strictly ascending list by adding or subtracting values from [0,m] from each element of L except Read More …

Problem Detail: Assume we are working in a Turing-complete, referentially-transparent, higher-order language that supports arbitrary dataflow unification. Shouldn’t it then be possible to construct the following function (using Haskell-like syntax, because that’s what I’m most familiar with)? — Takes an arbitrary Read More …

Problem Detail: I’m a beginner in learning about computational complexity and this has stumped me. I’ve read that by the time hierarchy theorem, it’s known that EXP-complete problems are not in P. (Wikipedia) It makes absolute sense intuitively that this is Read More …

Problem Detail: There are definitions of Absolute, Strong and Weak Fairness available across the internet, but I cannot find a definition of “K-Fairness” property for critical section algorithms (also algorithms that satisfy a 1-fairness or 3-fairness property). Does this actually exist Read More …

Problem Detail: I’ve read that “Every problem in NP can be reduced to every NP-complete problem”. My question is on the choice of the word “reduce”. If I were to “reduce” a polynomial problem in NP to an exponential problem in Read More …

Problem Detail: I was told by my adviser (future one) to look into libsvm library or any other and try to get familiar with it.. to work on a programming project (on Machine Learning) (will start in a month). my background: Read More …

Problem Detail: It is well-known that every boolean function $f:{0,1}^nto {0,1}$ can be realized using a boolean circuit of depth 2 (over the variables, their negation and constant values) containing AND gates in the first level and one single OR gate Read More …

Problem Detail: Valiant & Vazirani proved SAT is reducible to UNIQUE SAT under randomized probabilistic reductions in polynomial time. Calabro et al. showed that UNIQUE k-SAT is as hard as k-SAT. Now the question is, if someone shows s that UNIQUE Read More …

Problem Detail: As per the title I was wondering if it’s possible for a language $L subseteq Sigma^{*}$ to have $Sigma^{*}$ as its syntactic monoid and if so could one give an example of such a language? I first thought that Read More …