Category: Uncategorized

Problem Detail: StackOverflow pointed me here, so the question might be a bit in a layman’s terms. Wikipedia defines pure functions as In computer programming, a function may be described as a pure function if both these statements about the function Read More …

Problem Detail: From what I’ve read, an example of infinite ambiguity is usually given in a form of a loop: $S rightarrow aA A rightarrow B B rightarrow A B rightarrow b$ But a grammar is called ambiguous if there’s more Read More …

Problem Detail: I am reading one of Guido van Rossum’s essays on optimization in Python. We are interested in converting a Python list of integers to their character equivalents. Here’s the straightforward algorithm. def f3(list): string = “” for character in Read More …

Problem Detail: The Schönhage–Strassen multiplication algorithm works by turning multiplications of size $N$ into many multiplications of size $lg(N)$ with a number-theoretic transform, and recursing. At least I think that’s what it does because there’s some other cleverness and I really Read More …

Problem Detail: I am about to implement a domain specific language for representation of social learning conventions. Part of the implementation is a formal description of a language – its ‘calculus’, symbols and logical expressions. My approach would be to describe Read More …

Problem Detail: The definitions I’ve found were highly technical and using terms I’ve never seen before. Say, I have a certain irrational number e that I get get closer and closer to with a computer and I want to determine if Read More …

Problem Detail: Given $n$ points in $mathbf{R}^2$, define the optimal Euclidean Steiner tree to be a minimum (Euclidean) length tree containing all $n$ points and any other subset of points from $mathbf{R}^2$. Prove that each of the additional points must have Read More …

Problem Detail: Can you help me with this problem ? Given an undirected graph $G$ and an integer $n$, prove that determining whether the graph has wheel on $n$ vertices $W_{n}$ (a wheel $W_{i}$ is such that $i$ nodes form a Read More …

Problem Detail: I am studying formal language theory and have been asked to prove the following: $forall L, L^*=(L^*)^*$ I’ve started with $def. L^* = bigcup_{i in mathbb{N}} L_i, L_0={{epsilon}}, L_1={L}, L_{i+1}={uv|uin L_i, vin L}$ $then (L^*)^* = bigcup_{i in mathbb{N}} Read More …

Problem Detail: I have a statement I am trying to prove, and I’m very close, but I think I’m missing a couple of key concepts about regular and context-free languages. Question: Let $ A = { ww | w epsilon Sigma^{*} Read More …