Blog

Problem Detail: A basic instruction cycle consists of these 5 stages. Instruction Cycle IF – Instruction Fetch RD – Instruction Decode and Register Read EX – Execute MA – Memory Access WB – Write Back I understood the function of all Read More …

Problem Detail: There’s a question on SO asking why in Java the right type doesn’t get picked in a concrete case. I know that Java can’t do it in such “complicated” cases, but I’m asking myself WHY? The (for simplicity slightly Read More …

Problem Detail: I would like to be able to represent circles in x-y coordinates. Each circle contains an x and y coordinates and radius in double data type. My goal is to compare circles with each other whether they are partially Read More …

Problem Detail: Let $cal{S}={S_i}_{1leq ileq n}$ be a partial $(m,k)$-design and $f: {0,1}^m to {0,1}$ be a Boolean function. The Nisan-Wigderson generator $G_f: {0,1}^l to {0,1}^n$ is defined as follows: $$G_f(x) = (f(x|_{S_1}) , ldots, f(x|_{S_n}) )$$ To compute the $i$th Read More …

Problem Detail: From the Introduction section of Homotopy Type Theory book: Type theory was originally invented by Bertrand Russell … It was later developed as a rigorous formal system in its own right(under tha name “$lambda$-calculus”). Can anyone explain me this Read More …

Problem Detail: Say we have N persons and M items (when a person has a certain item, she usually only has one piece). For example, person 1 has item A, C, D, and wants item F person 2 has item B, Read More …

Problem Detail: I am having trouble simplifying logical expressions to a much simpler form, can someone provide me some insight on how to approach the problem? Let’s assume i have the following expression: $ABCD + Abar{B}CD$. I am aware of the Read More …

Problem Detail: Deterministic context-free languages are commonly defined using an automaton concept, the (restricted, deterministic) pushdown automaton. To some that is confusing, as the name context-free refers to a grammar type. I seem to remember there exists a characterization of the Read More …

Problem Detail: Multi-label classification is a machine-learning problem where each sample can have zero or more labels from a closed set of possible labels. This task has applications in several fields. For example, in dialog systems, each sentence that the human Read More …

Problem Detail: Recently an interesting question was asked and subsequently deleted. For a regular language $L$, its DFA complexity is the size of the minimal DFA accepting it, and its NFA complexity is the size of the minimal NFA accepting it. Read More …