Problem Detail: Can we algorithmically infer the number of comets that orbit the Earth, based upon periodic observations of them, if we cannot tell the comets apart? In more detail: The problem There is an unknown, fixed number of comets, numComets Read More …
Category: Uncategorized
[Solved]: ML function of type ‘a -> ‘b
Problem Detail: Our professor asked us to think of a function in OCaml that has the type ‘a -> ‘b i.e. a function of one argument that could be anything, and that can return a different anything. I thought of using Read More …
[Solved]: Are two non-Turing-recognizable languages closed under union?
Problem Detail: If I have two languages that aren’t Turing-recognizable, is the union between them always not T-recognizable? Why? Asked By : RobotMan Answered By : jmite No, sometimes you can recognize their union. As an example, take a language where it and Read More …
[Solved]: Why are all problems in FPTAS also in FPT?
Problem Detail: According to the Wikipedia article on polynomial-time approximation schemes: All problems in FPTAS are fixed-parameter tractable. This result surprises me – these classes seem to be totally different from one another. FPTAS characterizes problems by how easy they are Read More …
[Solved]: Solution to recurrence $T(n) = T(n/2) + n^2$
Problem Detail: I am getting confused with the solution to this recurrence – $T(n) = T(n/2) + n^2$ Recursion tree – T(n) Height lg n + 1 | T(n/2) | T(n/4) So it turns out to be – $T(n) = n^2(1 Read More …
[Solved]: Real world applications for Steiner Tree Problem?
Problem Detail: Are there real-world applications of the Steiner Tree Problem (STP)? I understand that VSLI chip design is a good application of the STP. Are there any other examples of real world problems that people can suggest of that could Read More …
[Solved]: How is this problem related to the study of algorithms and big O notation?
Problem Detail: I’m taking a graduate computer science course on algorithms and analysis. The current subject is big O notation and recursion. How is the following problem related to the study of algorithms, recursion, and big O notation? I know and Read More …
[Solved]: Arbitrary precision integer square root algorithm?
Problem Detail: Are there any known subquadratic algorithms for calculating the floor of the square root of an n bit integer? The naive algorithm would be something like def sqrt(x): r = 0 i = x.bit_length() // 2 while i >= Read More …
[Solved]: Are Java and C# also purely interpreted languages?
Problem Detail: I was wondering about the nature of these managed languages i-e since c# and java both are converted into intermediate language and byte code respectively, and are interpreted by their respective runtime(s). So if they are somehow pure interpreted Read More …
[Solved]: Turing recognizable & decidable: binary strings with even length. Let A = {(M) | M is a DFA such that L(M) is not the same as EVEN}
Problem Detail: Having trouble with this homework problem. In order to show that A is Turing recognizable and decidable. $text{EVEN} = text{binary strings with even length}$ $Let;A = {(M) | ,M; text{is a DFA such that L(M) is not the same Read More …
