Problem Detail: I don’t understand this definition of an “instance” of a problem. Quoting from the CLRS book on page 1054 on abstract problems (Chapter 34.1): We define an abstract problem $Q$ to be a binary relation on a set $I$ Read More …
Blog
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 …
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 …
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 …
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 …
Gödelization in Turing Machine
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 …
Why does introsort use heapsort rather than mergesort?
Problem Detail: As part of a homework assignment covering implementation of introsort I’m asked why heapsort is used rather than mergesort (or other $O(nlog(n))$ algorithms for that matter). Introsort is a hybrid sorting algorithm that provides both fast average performance and Read More …
Why did RSA encryption become popular for key exchange?
Problem Detail: This is a soft question. I don’t know a lot about cryptography or its history, but it seems like a common use for RSA is to do key exchange by encrypting a symmetric key to send a longer message Read More …
Regular languages that can’t be expressed with only 2 regex operations
Problem Detail: I thought all regular languages could be expressed with regular expressions (if a language is regular, it can be expressed with regex), but I have been told that you need all three of the regular operations (concatenation, union, and Read More …
Good explanatory resource for algorithm techniques such as greedy, backtracking and recursive functions
Problem Detail: What would be a good book/resource that explains the basic idea behind those techniques, how to use (and maybe when to use them) and plenty of exercises with perhaps some worked examples (kind of like when for loops were Read More …