Author: ignougroup

Problem Detail: Reading a course on genetic programming, the first chapter describes the syntax tree as the basic representation of programs in genetic programming. What are the reasons leading to the choice of a syntax tree in genetic programming? Are there Read More …

Problem Detail: We know that every non-regular language can be recognized with $ Omega (loglog n) $ space complexity. I’m looking for an example of a language which is $ Theta (loglog n) $ space complexity (if such exists). Asked By Read More …

Problem Detail: I’m trying to practice myself with random algorithms. Lets call a CNF formula over n variables s-formula if it is either unsatisable or it has at least $frac{2^n}{n^{10}}$ satisfying assignments. I would like your help with show a randomized Read More …

Problem Detail: First off, I am not sure if this is the correct stackexchange site to ask this question on, so moderators can feel free to move it. I am working on an application that identifies an object in an image. Read More …

Problem Detail: Short version: I want to know where the $-2$ comes from in the formula on p. 221 of CLRS 3rd edition. Long version: CLRS (3rd ed.) give an algorithm for $O(n)$ worst case arbitrary order statistic of $n$ distinct Read More …

Problem Detail: Let $mathcal{B} = {v_1,v_2,ldots,v_k} in mathbb{R}^n$ be linearly independent vectors. Recall that the integer lattice of $mathcal{B}$ is the set $L(mathcal{B})$ of all linear combinations of elements of $mathcal{B}$ using only integers as coefficients. That is $$L(mathcal{B}) = { Read More …

Problem Detail: Consider a machine that has nested interrupts (a higher priority interrupt can interrupt a lower priority one, the current instruction’s address is saved and later restored). Why would a programmer want to disable all interrupts using instructions like x86’s Read More …

Problem Detail: I am trying to solve the following problem: For each Turing machine $M_k$ and each string $x$ in ${$0,1$}$$^ast$ let $time_k(x)$ = ${$the number of steps executed by $M_k(x)$ if $M_k(x)$$downarrow$ (halts), and $infty$ if $M_k(x)$$uparrow$ (does not halt)$}$ Read More …

Problem Detail: I am working through Sipser, and I am trying to understand some of the algorithms described in Space Complexity, but I am having a hard time understanding the presentation of the material (especially Savitch’s theorem). I have a very Read More …