Blog

Problem Detail: There is no general analytic solution to the n-body problem that can produce an analytic function which can be used to give an n-body system’s state at arbitrary time t with exact precision. However, there are some special cases Read More …

Problem Detail: How is asymptotic analysis (big o, little o, big theta, big theta etc.) defined for functions with multiple variables? I know that the Wikipedia article has a section on it, but it uses a lot of mathematical notation which Read More …

Problem Detail: I’ve designed a few databases in my time, and on more than one occasion the drive to abstract common elements from specific tables has led me to create generic top-level tables which contain those common elements. For example: Table Read More …

Problem Detail: I am interested in testing for a given string (w) whether it is in the language (L) defined by a nondeterministic finite automaton (A). I have some blurry point in my mind. What is the complexity of this test Read More …

Problem Detail: $L = {0^i1^j0^i1^j|i,j geq 0}$ I’ve tried letting $s = 0^p1^p0^p1^p$. But not sure where to go from here. Help would be appreciated. Asked By : user678392 Answered By : Patrick87 Take a look at the following proof; if this is Read More …

Problem Detail: I am interested in the following version of TSP: Assumption: TSP where the distances are non-negative. We know the algorithm A which computes the optional solution for such instances of TSP. Task: State an algorithm that uses the algorithm Read More …

Problem Detail: I’m wondering about the relationship between computational complexity and the Chomsky hierarchy, in general. In particular, if I know that some problem is NP-complete, does it follow that the language of that problem is not context-free? For example, the Read More …

Problem Detail: i am currently working on a school project that takes in a simple linear equation and has to return the value of x, the code i have transforms x + 3 = 3x – 2 into a binary tree Read More …