Problem Detail: If the definition of Initial Algebra is: “An object is initial if there exists a unique morphism from the object to every object in the category” Why do we need such object, and could any one give an example Read More …
Author: ignougroup
[Solved]: Why isn’t converting from an NFA to a DFA working?
Problem Detail: I am just beginning to learn computation theory. I wrote up a non-deterministic finite automata that accepts strings that contain the substring “abba”: I tried to convert it to a DFA by putting together sets of states in the Read More …
[Solved]: Doron ZEILBERGER’s P = NP computer proof
Problem Detail: In 2009 Doron has published a paper stating “Using 3000 hours of CPU time on a CRAY machine, we settle the notorious P vs. NP problem in the affirmative, by presenting a “polynomial” time algorithm for the NP-complete subset Read More …
[Solved]: use of unconditional transfer of control instruction
Problem Detail: I did not understand why unconditional transfer of control instruction is used in cpu.So if we already know we have to jump to an instruction and skip some instruction irrespective of any condition then why do we not avoid Read More …
[Solved]: Good mathematical book on algorithms
Problem Detail: I’m a sucker for mathematical elegance and rigour, and now am looking for such literature on algorithms and algorithm analysis. Now, it doesn’t matter much to me what algorithms are covered, but very much how they are presented and Read More …
[Solved]: Provide some help regarding the “Dining Philosophers Problem”?
Problem Detail: I have an assignment based on operating systems and the question is divided into two sub-questions. The first is: Prove any seating arrangement of lefties and righties, with at least one of each avoiding deadlock. The second: Prove any Read More …
[Solved]: How do I show that a DFA accepts only one word?
Problem Detail: I want to show that $qquaddisplaystyle O = {M : M text{ is a DFA}, |L(M)| = 1}$. Here $|L(M)|=1$ means the DFA contains only one state. I really don’t know where to get started in this problem. Should Read More …
[Solved]: Halting problem without self-reference
Problem Detail: In the halting problem, we are interested if there is a Turing machine $T$ that can tell whether a given Turing machine $M$ halts or not on a given input $i$. Usually, the proof starts assuming such a $T$ Read More …
[Solved]: Language for teaching basic programming
Problem Detail: I’m interesting in teaching programming to middle school students. I’d like a programming language with the following criteria: Simple – pared down to the absolute minimum needed to support sophisticated programming without too much code. As such, for this Read More …
[Solved]: Turing Machine that computes maximum steps of halting machines
Problem Detail: Suppose that $TM_{halting}$ is the set of machines that halt. Given a number of states $m$ and a length $n$ of the input, let $f(m,n)$ be the maximum number of steps a machine with $m$ states in $TM_{halting}$ can Read More …
