Problem Detail: When trying to decide on the choice of a programming language for a specific task, people will often tell me: “use this language because it has the best library for the type of problems you are addressing”. I would Read More …
Category: Uncategorized
[Solved]: Find the centre of a circle given two points lying on it and its radius
Problem Detail: We have been given 2 points on a circle and its radius. Now I want to find out the centre point of such a circle. How can I code this efficiently without solving the quadratic equations? Asked By : Nikunj Read More …
[Solved]: What is the difference between shortest distance and shortest path?
Problem Detail: I am studying graph currently. I found a question, which asks for The List A[] which shows shortest distances between $V$ and every other vertex The List B[] which shows shortest paths between $V$ and every other vertex as Read More …
[Solved]: Lazily computing a random permutation of the positive integers
Problem Detail: Are there any existing efficient algorithms for lazily computing a random permutation of the positive integers in a given range (e.g. the range offered by an unsigned integer type in a CPU)? What I mean is this: An algorithm Read More …
[Solved]: What’s the difference between Adaptive Control and Hierarchical Reinforcement Learning?
Problem Detail: After watching Travis DeWolf presentation on scaling neural computation, I’m a bit confused about the difference between Reinforcement Learning (whether hierarchical or not) and Adaptive Control. They both seem to be exploring environments and minimizing error through learning, but Read More …
[Solved]: Example for the analysis of a recursive function
Problem Detail: l is a matrix of size [1…n, 1…n] function: rec(i,j) if (i*j == 0) return 1 else if (l[i,j] == 0) l[i,j] = 1 * rec(i-1,j) + 2 * rec(i,j-1) + 3 * rec(i-1,j-1) return l[i,j] end_function for Read More …
[Solved]: A regular expression for a given formal language
Problem Detail: I wanted to ask if someone can help me to construct a regular expression over the alphabet ${a,b,x}$ for the language $L$ which is constituted by all strings containing an odd number of $a$’s, and in which between each Read More …
[Solved]: Time Complexity of Regular Languages
Problem Detail: I wonder how I can go about proving that if a language L is decidable in o(nlog(n)) then L must be regular. I should probably mention that by “decidable” I mean “being decidable by single-tape deterministic turing machine”. Thanks Read More …
[Solved]: NSPACE for checking if two graphs are isomorphic
Problem Detail: I was studying nondeterministic Turing Machines and came across the following question: Describe a nondeterministic Turing Machine (NTM) that only accepts two graphs (G1 and G2) if they are isomorphic, and provide the NSPACE. The NTM should use as Read More …
[Solved]: Forward checking with conflict directed backjumping
Problem Detail: Can somebody explain me how can I join forward checking with conflict directed backjumping in my CSP solver? I understand that when the consistency fails when I add a value to a variable, I should save all the instantiated Read More …
