Problem Detail: I was looking at Gödelization in Theory of Computation course. I could understand the Gödel numbering concepts, but couldn’t understand its importance in Theory of Computation. Could anyone please point to some good materials or point out its importance. Read More …
Category: Uncategorized
designing a DFA and the reverse of it
Problem Detail: There is a theorem that says if a language is regular, it’s reverse is regular as well. How can I draw a DFA that shows if a language is regular, it’s regular as well? Asked By : Parisa Answered By Read More …
Difference between weak and strong AI
Problem Detail: I’m trying to understand the difference between weak and strong AI. For an example, let’s say we would pass the turing test – would it show strong AI or weak AI then? I don’t believe that this is standard Read More …
Proving NP-completeness of a graph coloring problem
Problem Detail: Given a graph $G=(V,E)$ and a set of colors $k<V$. Find a assignment of colors to vertices that minimizes the number of adjacent vertices in conflict. (Two adjacent vertices are in conflict if they have the same color.) I Read More …
Are semantic networks ontologies?
Problem Detail: I struggle with few definitions in knowledge representation and seek credible help to distinguish between them. I have been searching on wikipedia and many websites for the difference between ontologies and semantic networks (not to be confused with semantic Read More …
How to find the cost of pseudocode with a nested loop and a nested if statement?
Problem Detail: How can I find the cost of pseudocode with a nested loop and a nested if statement? On the left hand side is an example from a textbook I am following. On the right hand side is pseudo code Read More …
How fast can we find all Four-Square combinations that sum to N?
Problem Detail: A question was asked at Stack Overflow (here): Given an integer $N$, print out all possible combinations of integer values of $A,B,C$ and $D$ which solve the equation $A^2+B^2+C^2+D^2 = N$. This question is of course related to Bachet’s Read More …
Is there any theoretically proven optimal compression algorithm?
Problem Detail: Is Huffman coding always optimal since it uses Shanon’s ideas? What about text, image, video, … compression? Is this subject still active in the field? What classical or modern references should I read? Asked By : Zeta.Investigator Answered By : Arani Read More …
Evolving artificial neural networks for solving NP problems
Problem Detail: I’ve recently read a really interesting blog entry from Google Research Blog talking about neural network. Basically they use this neural networks for solving various problems like image recognition. They use genetic algorithms to “evolve” the weights of the Read More …
Recurrences and Generating Functions in Algorithms
Problem Detail: Combinatorics plays an important role in computer science. We frequently utilize combinatorial methods in both analysis as well as design in algorithms. For example one method for finding a $k$-vertex cover set in a graph might just inspect all Read More …
