Problem Detail: I know that we can visualize a Non deterministic TM as a TM which splits into multiple copies of itself whenever it sees a non deterministic path (Yes, I also know that this is just a visualization and is Read More …
Category: Uncategorized
[Solved]: Corresponding noun for “side-effect-free”?
Problem Detail: For functions or computations we have terms like: Deterministic – Determinism Pure – Purity Now what is the correct corresponding noun for side-effect-free? “Side-effect freeness”? “Side-effect freedom”? “Non-side-effective”? Asked By : rolve Answered By : David Richerby A good rule of Read More …
[Solved]: Is there a difference between $lambda xy.xy$ and $lambda x.lambda y.xy$?
Problem Detail: I am currently learning the lambda calculus and was wondering about the following two different kinds of writing a lambda term. $lambda xy.xy$ $lambda x.lambda y.xy$ Is there any difference in meaning or the way you apply beta reduction, Read More …
[Solved]: Would it ever be possible for computer viruses to evolve new “genes” to allow them to perform their job?
Problem Detail: As an A-level Biology student, I have thought a lot about the links with Biology and Computer Science, and something that often comes to mind are the links between Immunology and Computer Security/Viruses. For example, I (through reading about Read More …
[Solved]: Quantum computers and computable functions
Problem Detail: A quantum computer can possibly calcluate computable functions faster, but it can’t calculate functions which a normal computer can’t calculate? If a function is not computable? Does this mean it will never be computable? Even if we change the Read More …
[Solved]: BCNF Decomposition: Confusion regarding given answer
Problem Detail: I encountered the following question: Given a relation R(A, B, C, D) with the following functional dependencies: A -> B, C -> D, B -> C. The BCNF Decomposition of R is: A) {(A,B), (C,D), (B,C)} B) {(A,B), (C,D), Read More …
[Solved]: Need a hint! Karger’s algorithm versus Kruskal, spanning tree distribution
Problem Detail: Let G = (V,E) be a unit-capacity graph with n vertices and m edges. Let T denote all the spanning trees in G. If we run Karger’s algorithm, we will get a random spanning tree in T formed by Read More …
[Solved]: Finding edges with minimal weight sum, such that every simple cycle contain at least one edge
Problem Detail: Given simple, udirected and connected graph with $n$ verticies. Every edge in this graph has some weight. I have to find (in polynomial time) a set of edges such that : 1.every simple cycle in graph contains at least Read More …
[Solved]: Heuristics & Constrain Satisfaction Problem Differences
Problem Detail: I’m currently taking an Algorithms course, and we are covering Backtracking, CSP, and heuristics. However, I’m getting confused on exactly the differences between these terms and their applications. When using Backtracking on a problem, I understand we are calculating Read More …
[Solved]: Definition of “c-competitive” algorithm
Problem Detail: What is the definition of a “c-competitive” algorithm? For example what does it mean, if we say that there is a 2-competitive algorithm for packet routing? Asked By : George Ts Answered By : Bartosz Przybylski You are given algorithm $ALG$ Read More …
