Blog

Problem Detail: I have trouble understanding Turing’s halting problem. His proof assumes that there exists a magical machine $H$ which could determine whether a computer would halt or loop forever for a given input. Then we attach another machine that reverses Read More …

Problem Detail: This is a basic question, but I’m thinking that $O(m+n)$ is the same as $O(max(m,n))$, since the larger term should dominate as we go to infinity? Also, that would be different from $O(min(m,n))$. Is that right? I keep seeing Read More …

Problem Detail: In class last week, my professor commented and said that Turing machines are used as a standard measure/model of what is computable and are a helpful basis of discussion for that subject. She also said that all variants of Read More …

Problem Detail: While I was doing CLRS (3rd edition), I came across this question on page 629: Professor Sabatier conjectures the following converse of Theorem 23.1: Let $G = (V,E)$ be a connected, undirected graph with a real-valued weight function $w$ Read More …

Problem Detail: For measuring the complexity of an algorithm, is it time complexity, or computational complexity? What is the difference between them? I used to calculate the maximum (worst) count of basic (most costing) operation in the algorithm. Asked By : Median Read More …

Problem Detail: A multi-user, multi-processing operating system cannot be implemented on hardware that does not support Address translation DMA for disk transfer At least two modes of CPU execution (privileged and non-privileged) Demand paging My attempt: Somewhere it explain as : Read More …

Problem Detail: A true/false question: If a DFA $M$ contains a self-loop on some state $q$, then $M$ must accept an infinite language. The answer is “false”. I’ve read this question, but I’m still wondering why $M$ does not necessarily accept Read More …

Problem Detail: Generic sorting algorithms generally take a set of data to sort and a comparator function which can compare two individual elements. If the comparator is an order relation¹, then the output of the algorithm is a sorted list/array. I Read More …

Problem Detail: Functional programming employs persistent data structures and immutable objects. My question is why is it crucial to have such data structures here? I want to understand at a low level what would happen if the data structure is not Read More …