Problem Detail: Given an input item (N bytes), I’m looking for a function that will map this to an output (still N bytes). The function should have the following qualities: It should be 1-to-1 so that all inputs map to some Read More …
Blog
[Solved]: Z-score relations to perceptrons
Problem Detail: I am learning about preceptrons and my professor noted that z-scores are a commmon pre-processing step to normalizing input variables. Following this, I am having trouble understanding why z-scores are useful when training a preceptron? My current understanding is Read More …
[Solved]: What happens to multi-qubit quantum state after one of qubits is measured?
Problem Detail: If we have a quantum state consisting of (let’s say) 3 entangled qubits and we read the value of one of them, what happens to the probabilities of the remaining possible states? For example, if we have three entangled Read More …
[Solved]: Genetic Algorithm Minimum Population Size
Problem Detail: Is there a minimum limit to a pool (population) size when using the genetic algorithm to solve an optimization problem? For example a population of size 2. Asked By : Declan Murphy Answered By : Philippe Olivier I had a similar Read More …
[Solved]: lexicographic depth-first search complexity class
Problem Detail: It seems to me to be incorrect to say that lexicographic DFS is P-complete, since it isn’t a decision problem. There is a corresponding decision problem, first DFS ordering, which is known to be P-complete. However, I want to Read More …
[Solved]: Deciding the set of all Turing machines that halt in at most $k|x|$ steps $forall x in Sigma^*$
Problem Detail: Let $L = { <M> | M$ halts on every input $x$ in at most $200 * |x|$ steps $}$. Is $L$ decidable? Recognizable? Given that membership in $L$ asserts something about $M$’s behavior on an infinite set of Read More …
[Solved]: What is a Turing Machine in class coNP
Problem Detail: On the wikipedia article about the polynomial hierarchy http://en.wikipedia.org/wiki/Polynomial_hierarchy it says “$A^B$ is the set of decision problems solvable by a Turing machine in class A augmented by an oracle for some complete problem in class B” What is Read More …
[Solved]: Equality of NSpace and coNSpace classes
Problem Detail: I’m trying to decide which of the following statements are true: $mathsf{NSpace}(log log n) = mathsf{coNSpace}(log log n )$ $mathsf{NSpace}(lg^2n) = mathsf{coNSpace}(lg^2n)$ $mathsf{NSpace}(sqrt n) = mathsf{coNSpace}(sqrt n)$ I thought immediately that (1) is correct since $lg lg n < Read More …
[Solved]: Proof of equivalence of parse-trees and derivations
Problem Detail: Intuitively, every derivation in a context-free grammar corresponds to a parse-tree and vise versa. Is this intuition correct? If so how can I formalize and prove such a thing? Asked By : saadtaame Answered By : saadtaame Theorem. Let $G = Read More …
[Solved]: Complexity classes that are closed under subtraction
Problem Detail: Are NP or P closed under subtraction? Im having a hard time deciding whether they are or aren’t. Question was edited Original question: Im having some hard time figuring out what languages are closed under subtraction. Say you have Read More …
