Problem Detail: I was studying the proof of Ackermann function being recursive, but not primitive recursive, and a question hit me: “So what?”. Why does it matter? What is the significance of primitive recursive functions? Asked By : Untitled Answered By : Yuval Read More …
Category: Uncategorized
[Solved]: Algorithm analysis question in growth of functions
Problem Detail: How would I solve the following. An algorithm that is $O(n^2)$ takes 10 seconds to execute on a particular computer when n=100, how long would you expect to take it when n=500? Can anyone help me answer dis. Asked Read More …
[Solved]: How can a universal Turing machine simulate “bigger” ones?
Problem Detail: I’m trying to find the answers of two questions about the Universal Turing machine. How can the Universal Turing machine simulate a Turing machine if the one that is being simulated has a bigger number of states? How can Read More …
[Solved]: Is there a basic proof that there exists some edit distance between two strings?
Problem Detail: Title says it all pretty much. I do realize that often edit distance is defined as the minimum number of operations needed to transform one string to another, but I want something to point to that’s even more general Read More …
[Solved]: Is finding a solution of a satisfiability problem harder than deciding satisfiability?
Problem Detail: Is the problem of determining whether or not a given Boolean expression is satisfiable computationally distinct from actually finding a solution to the expression? In other words, is there another way of finding that a given expression is satisfiable Read More …
[Solved]: What is OUTER UNION and why is it partially compatible
Problem Detail: I am trying to understand how a OUTER UNION $∪^✳$ works, and why it is only partially compatible. I am aware this operation was created to take union of tuples from two relations if the relation are not type Read More …
[Solved]: Is this NIM game tree correct?
Problem Detail: I have an assignment to construct a game of Nim (a game in which two players must divide a pile of tokens into two unequal sizes; 6 can be divided into 2 & 4 but not 3 & 3). Read More …
[Solved]: Is Wadler’s ‘Theorems for Free’ as general as Design By Contract for establishing correctness?
Problem Detail: Philip Wadler has written a brilliant paper called ‘Theorems for Free’. The big idea is that you can use types to reason about your program, and even prove simple theorems about your program. We see these ideas about types Read More …
[Solved]: Need an algorithm to find the input factors that are most affecting the output
Problem Detail: I apologize if this question is already answered and appreciate any pointers to existing answers. I’m not familiar with statistical or data mining terms so my search was limited to basic words used in the title of this question. Read More …
[Solved]: Counting trees (order matters)
Problem Detail: As a follow up to this question (the number of rooted binary trees of size n), how many possible binary trees can you have if the nodes are now labeled, so that abc is different than bac cab etc Read More …
