Problem Detail: I’m learning about undecidability, and found this question: Is this language decidable, make a proof: L = { M : machine M halts for every input of length not exceeding 100 } Update: This is translated from an exam Read More …
Author: ignougroup
Counting Inversions Using Merge Sort
Problem Detail: In Corman, Introduction To Algorithms, 3rd edition, question 2-4 it asks to count the number of inversions in a list of numbers in $theta( n lg n )$ time. He uses a modified Merge Sort to accomplish this. However, Read More …
Getting parallel items in dependency resolution
Problem Detail: I have implemented a topological sort based on the Wikipedia article which I’m using for dependency resolution, but it returns a linear list. What kind of algorithm can I use to find the independent paths? Asked By : Masse Answered Read More …
The stable marriage algorithm with asymmetric arrays
Problem Detail: I have a question about the stable marriage algorithm, for what I know it can only be used when I have arrays with the same number of elements for building the preference and the ranking matrices. For example if Read More …
What are flops and how are they benchmarked?
Problem Detail: Apple has just proudly stated that their new mac pro will be able to give up to 7 teraflops of computing power. Flops stands for Floating Point Operations Per Second. How exactly is this benchmarked though? Certain floating point Read More …
Reduce Vertex cover to SAT
Problem Detail: I need to reduce the vertex cover problem to a SAT problem, or rather tell whether a vertex cover of size k exists for a given graph, after solving with a SAT solver. I know how to reduce a Read More …
Why does this automation accept the empty string?
Problem Detail: I am new to Automata Theory. I am studying the book thoroughly and understanding it well. I have got a confusion regarding NFA. Why does this automaton accept the empty string λ? What I think is that: implicitly δ(q,λ)=q Read More …
What’s Big O of $log(n+7)^{log(n)}$?
Problem Detail: As part of my continual improvement plans, I’m reviewing algorithm analysis and I’ve hit a roadblock. I cannot figure out how to determine the Big O complexity of $log(n+7)^{log(n)}$. I’ve spent the last few days rolling this over in Read More …
Complexity analysis of while loop with two conditions
Problem Detail: I am curious how to do a line by line analysis of this piece of code using the “Big O” notation. i = 0; j = 0; while ( ( i < n ) && ( j < m Read More …
Intro to Martin-Löf type theory
Problem Detail: What would be the best introduction to Per Martin-Löfs ideas about type theory? I’ve looked at some lectures from the Oregon PL summer school, but I’m still sort of puzzled by the following question: What is a type? I Read More …
