IgnouGroup Social Campus
Problem Detail: I’ve been reading these: Fast Reduction from RSA to SAT CNF Generator for Factoring Problems (Also have C code implementation) I don’t understand how the reduction from FACT to $3text{-SAT}$ works. Are there any simple articles in which I Read More …
Problem Detail: Constructivist logic is a system which removes the Law of the Excluded Middle, as well as Double Negation, as axioms. It’s described on Wikipedia here and here. In particular, the system doesn’t allow for proof by contradiction. I’m wondering, Read More …
Problem Detail: I am trying to understand what is meant by “deterministic” in expressions such as “deterministic context-free grammar”. (There are more deterministic “things” in this field). I would appreciate an example more then the most elaborate explanation! If possible. My Read More …
Problem Detail: I am reading William Stallings Computer Organization & Architecture to understand about control unit & micro-operations. Stallings explain that interrupt cycle requires 3 time units to complete : t1 : MBR <- (PC) t2 : MAR <- Save_Address PC Read More …
Problem Detail: I am trying to find the sum of 1 bits in the range between A and B inclusive, where -2^31 <= A <= B <= 2^31 – 1 Input Format: The first line contains the number of test cases Read More …
Problem Detail: Do they need to “unwind” exactly to the same set of paths or does it suffice when one set is contained in the other ? Or is it sufficient to argue that M,s satisfies both LTL formulas for any Read More …
Problem Detail: I would like to show that the following language is recognizable: $$L:= { langle M rangle mid M text{ is a TM that halts on some string}}.$$ How do I go about showing that this language is recognizable? I Read More …
Problem Detail: I read that Name binding assigns some value (data/code/expression) to an identifier. Assignment and valuation seem to do the same thing. It is confusing. Can I just tell that free variable is one, which was not assigned a value Read More …
Problem Detail: I always read that finding an independent set of size $k$ in a graph is $mathsf{NP}$-complete. However, this only requires looking for all combinations of $k$ vertices and this is a polynomial procedure of order $k$. I know that Read More …
Problem Detail: Wikipedia says that shared memory comes with lots of costs associated with cache coherence costs. But I thought the whole idea of shared memory is that all the CPUs access the same memory? So if one CPU changes that Read More …
