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 …
Author: ignougroup
[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]: 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]: 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]: 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]: 1-to-1 cryptographically secure bit shuffling
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 …
[Solved]: How to draw a graph to disprove this statement?
Problem Detail: The Problem: Indicate whether the following statements are true or false: a. If e is a minimum-weight edge in a connected weighted graph, it must be among edges of at least one minimum spanning tree of the graph. b. Read More …
[Solved]: What does it mean to say that there doesn’t exist an algorithm from a TM point of view?
Problem Detail: A TM for a recursive language corresponds to our informal notion of an algorithm. as per Automata Theory, Languages and Computation by Ullman et al. Then there are languages called RE and $L_d$, where there exist TM that Read More …
[Solved]: Modification of Hamilton Path
Problem Detail: Although I know that the Hamilton Path problem is ${sf NP}$-complete, I think the following variant can be solved in polynomial time: Given a planar graph with vertex set $V$, edge set $E$, start node $S$ and target node Read More …
[Solved]: About Codd’s reduction algorithm
Problem Detail: Codd’s Algorithm converts an expression in tuple relational calculus to Relational Algebra. Is there a standard implementation of the algorithm? Is this algorithm used anywhere? (It seems that the industry only needs SQL and variants, I’m not sure about Read More …
