Problem Detail: I’m a little bit confused about the second condition of the pumping lemma which are: $|y|geq1$ $|xy|leq p$ $forall i geq 0:xyizin L$ I don’t understand why the length of substrings $xy$ has to be less than the pumping Read More …
Author: ignougroup
[Solved]: Algorithm: Cracking the Safe
Problem Detail: A safe is protected by a four-digit $(0-9)$ combination. The safe only considers the last four digits entered when deciding whether an input matches the passcode. For instance, if I enter the stream $012345$, I am trying each of Read More …
[Solved]: JIT, AOT, Interpretation: What are differences between them?
Problem Detail: I’m a beginner in Compilation. My understanding is that Interpretation means Interpreter takes source program as input and produce the result of this program.(source -> Interpreter -> run on the machine) Compilation means Compiler take source program as input Read More …
[Solved]: Why are lambda-abstractions the only terms that are values in the untyped lambda calculus?
Problem Detail: I am confused about the following claim: “The only values in the untyped lambda calculus are lambda-abstractions”. Why are the other terms not values? What does it mean for a lambda-abstraction to be a value? The first thing that Read More …
[Solved]: How do computers create ‘randomness’?
Problem Detail: I have just used a function ‘rand()’ in my algorithm. In fact, it was arc4random() that I used. However, it got me thinking, how is randomness created in a computer system? Can anything ever truly be random when it Read More …
[Solved]: definition of formula validity
Problem Detail: I read in some sources that valid formulas are tautologies (valid under every evaluation). In the others, I read that these are formulas that have conclusions true when premises are true. Are these just equivalent definitions because ⊨ P Read More …
[Solved]: Group isomorphism to graph ismorphism
Problem Detail: In reading some blogs about computational complexity (for example here)I assimilated the notion that deciding if two groups are isomorphic is easier than testing two graphs for isomorphism. For example, on the stated page it says that graph isomorphism Read More …
[Solved]: Blob detection as Constraint satisfaction problem?
Problem Detail: In image processing I have a black and white image which is represented by matrix {0,1}, I have to find blob (a region of connected pixels) in it. I’m confused, can this problem be reduced to Constraint Satisfaction problem Read More …
[Solved]: Why is SAT in NP?
Problem Detail: I know that CNF SAT is in NP (and also NP-complete), because SAT is in NP and NP-complete. But what I don’t understand is why? Is there anyone that can explain this? Asked By : user2795095 Answered By : vzn Try Read More …
[Solved]: Is induced subgraph isomorphism easy on an infinite subclass?
Problem Detail: Is there a sequence of undirected graphs ${C_n}_{nin mathbb N}$, where each $C_n$ has exactly $n$ vertices and the problem Given $n$ and a graph $G$, is $C_n$ an induced subgraph of $G$? is known to be in class Read More …
