Problem Detail: So, in lectures about Rice’s Theorem, reduction is usually used to proved the theorem. Reduction usually consists a construction of $M’$, using a TM $M$ which is in the form $langle M,w rangle$ to be simulated first, an input Read More …
Blog
[Solved]: Machine learning – importance of correlation vs. causation
Problem Detail: It is a well-known fact that “Correlation doesn’t equal causation”, but machine learning seems to be almost entirely based on correlation. I’m working on a system to estimate the performance of students on questions based on their past performances. Read More …
[Solved]: RAID: dedicated and distributed parity
Problem Detail: I understand what parity is (Sort of): A data recovery mechanism where missing data is calculated based on the data that exists. However i have encountered terminology which i can’t define or put into perspective of the RAID system. Read More …
[Solved]: Why is the number of states for DFA is 3n + 1 for this language
Problem Detail: I’m taking online compilers course. It’s long ended, so it wouldn’t be cheating to ask a question on quiz here. Let $S_i$ be the string consisting of $i$ 0’s followed by $2i$ 1’s. Define the language $L_n = { Read More …
[Solved]: Extracting features for texture classification
Problem Detail: I m a beginner in the field of pattern recognition and computer vision. I m working on a project right now to classify t-shirt patterns into three categories i.e. solids, stripes and checks. I have close up training images Read More …
[Solved]: How do i find bits in virtual and physical address?
Problem Detail: The question is: Consider a virtual address space of 256 pages with page size of 4KB, mapped onto a physical memory of 128 frames. How many total bits are required in the virtual address? How many total bits are Read More …
[Solved]: Shortest directed path connecting given subset of vertices
Problem Detail: Given weighted directed graph $G = (V,E,w)$, where $w : E to mathbb R^+$ source vertex $v in V$ vertex subset $U subset V$ how to find a shortest directed path from $v$ containing all vertices from $U$? Note Read More …
[Solved]: EXPTIME vs Super-polynomial time
Problem Detail: It is proven by Time hierarchy theorem that EXPTIME-complete do not belong to P even if we do not know if NP belong to P. Before I read wiki, I found EXPTIME algorithm for solving 3-sat, the brute algorithm Read More …
[Solved]: Optimal myopic maze solver
Problem Detail: I was fooling around with Google Blocky’s Maze demo, and remembered the old rule that if you want to solve a maze, just keep your left hand to the wall. This works for any simple-connected maze and can be Read More …
[Solved]: Reducing optimization problem to decision problem
Problem Detail: I’m trying to reduce an optimization problem to a decision problem, more specifically, consider the Max-Cut problem in its decision version: Given $(G=(V,E),k)$ as input, where $G$ is an undirected weighted graph (all weights are positive integers, formally: $w: Read More …
