Question Detail: I know that there exist a Turing Machine, if a function is computable. Then how to show that the function is not computable or there aren’t any Turing Machine for that. Is there anything like a Pumping lemma? Asked Read More …
Category: Uncategorized
What are the reasons to learn different algorithms / data structures serving the same purpose?
Question Detail: I have been wondering about this question since I was an undergraduate student. It is a general question but I will elaborate with examples below. I have seen a lot of algorithms – for example, for maximum flow problems, Read More …
Is there any concrete relation between Gödel’s incompleteness theorem, the halting problem and universal Turing machines?
Question Detail: I’ve always thought vaguely that the answer to the above question was affirmative along the following lines. Gödel’s incompleteness theorem and the undecidability of the halting problem both being negative results about decidability and established by diagonal arguments (and Read More …
Maximum Independent Set of a Bipartite Graph
Question Detail: I’m trying to find the Maximum Independent Set of a Biparite Graph. I found the following in some notes “May 13, 1998 – University of Washington – CSE 521 – Applications of network flow”: Problem: Given a bipartite graph Read More …
Show how to do FFT by hand
Question Detail: Say you have two polynomials: $3 + x$ and $2x^2 + 2$. I’m trying to understand how FFT helps us multiply these two polynomials. However, I can’t find any worked out examples. Can someone show me how FFT algorithm Read More …
Programming language where every expression makes sense
Question Detail: Per recommendation I am reposting this from Stack Overflow. Recently I have been thinking about following issue. Consider the code for a standard “Hello world!” program: main() { printf(“Hello World”); } Now almost any change in this code will Read More …
Finding the minimum cut of an undirected graph
Question Detail: Here’s a question from a past exam I’m trying to solve: For an undirected graph $G$ with positive weights $w(e) geq 0$, I’m trying to find the minimum cut. I don’t know other ways of doing that besides using Read More …
What does the "Lambda" in "Lambda calculus" stand for?
Question Detail: I’ve been reading about Lambda calculus recently but strangely I can’t find an explanation for why it is called “Lambda” or where the expression comes from. Can anyone explain the origins of the term? Asked By : Pickle Best Answer Read More …
How can I teach computer science without using computers?
Question Detail: In some places in the world, people don’t usually have access to (and hence little knowledge of) computers, and even if they have, hard- and software are outdated and usage plagued by power outages and such. Access to (good) Read More …
Order of growth definition from Reynolds & Tymann
Question Detail: I am reading a book called Principles of Computer Science (2008), by Carl Reynolds and Paul Tymann (published by Schaum’s Outlines). The second chapter introduces algorithms with an example of a sequential search which simply iterates through a list Read More …
