Problem Detail: I am wondering, is there a method for automatic runtime analysis that works at least on a relevant subset of algorithms (algorithms that can be analyzed)? I googled “Automatic algorithm analysis” which gave me this but it is too Read More …
Author: ignougroup
What is a partially computable function?
Problem Detail: In the book Computability, Complexity, and Languages, Martin Davis writes in chapter two: A partial function is said to be partially computable if it is computed by some program. and also A function is said to be computable if Read More …
Creating a Deterministic Push Down Automata
Problem Detail: I saw this old post on stack overflow of a PDA that accepts a language where there are exactly twice as many a’s as there are b’s. The image they used is below and so is the link to Read More …
P-Completeness and Parallel Computation
Problem Detail: I was recently reading about algorithms for checking bisimilarity and read that the problem is P-complete. Furthermore, a consequence of this is that this problem, or any P-complete problem, is unlikely to have an efficient parallel algorithms. What is Read More …
the convention for declaring arrays in pseudocode
Problem Detail: I have a very simple question. What is the right standard convention to use for declaring arrays? I understand that for a simple declaration of a variable as an integer, this is the convention: DECLARE myVar : INTEGER What Read More …
Local Search vs Classical Search
Problem Detail: I have some questions regarding local search / optimization as explained in chapter 4 of the book : http://aima.cs.berkeley.edu/ In classical search (Chap 3), the search starts from an initial node, then the search continues based on strategies of Read More …
Which algorithms are usable for heatmaps and what are their pros and cons
Problem Detail: This is a cross post from Stack Overflow, and DSP at Stackexchange since I cannot really decide which part of Stackexchange is most fitting. If this is the wrong place please tell me and I’ll remove the question. I Read More …
Why is Relativization a barrier?
Problem Detail: When I was explaining the Baker-Gill-Solovay proof that there exists an oracle with which we can have, $mathsf{P} = mathsf{NP}$, and an oracle with which we can have $mathsf{P} neq mathsf{NP}$ to a friend, a question came up as Read More …
Deriving the Sobel equations from derivatives
Problem Detail: Many sites give the Sobel operators as the convolution mask for smoothing an image. However, I haven’t found a single site that describes how you can derive the operators from partial first derivatives. If anyone can explain the derivation, Read More …
Convex polygon formulation
Problem Detail: We have a sorted list of side lengths that can be used to form a polygon. There are $n$ such values ($n le 1000$). Now we need to find if we can use any 10 of these values to Read More …
