Problem Detail: I apologize, but even after these two other posts: here and here I’m still having trouble understanding oracle TMs and relativization. This question comes at the issue from a different angle: Why are non-relativizing proofs considered more valid than Read More …
Category: Uncategorized
[Solved]: simulation of PDA with turing machine
Problem Detail: How to simulate a non-deterministic PDA with a turing machine? Asked By : odai Answered By : muratcakmak The sets of all languages that can be represented by a PDA is proper subset of the all languages that can be represented Read More …
[Solved]: provability of while loop vs for loop
Problem Detail: I’m abit afraid to ask this question here seeing as I asked it on programmers SE already, the thing is I think the question is more about the underlying theory than the use in practice (or call it confirmation Read More …
[Solved]: Fundamental algorithms in formal language-automata theory
Problem Detail: I’m willing to take a course in formal languages and automata theory , where we will explore side by side a functional programming language to implement the different algorithms we will encounter ,despite i am new to the language Read More …
[Solved]: anonymous lambda functions (functional programming)
Problem Detail: What are anonymous (lambda) functions? What is the formal definition of an anonymous function in a functional programming language? In my simple terms, when I am programming in scheme/lisp I would say an anonymous (lambda) function is a function Read More …
[Solved]: Why is it seemingly easier to resume torrent downloads than browser downloads?
Problem Detail: I really wonder how torrent downloads can be resumed at later point of time. If such a technology exists, then why is it not possible in browsers? It is often not possible to pause a browser download so that Read More …
[Solved]: How to prove that 3-coloring is decidable?
Problem Detail: In order to prove that 3-coloring is decidable, is it sufficient to say: Each node in the graph has 3 possible colors Therefore we can enumerate over all $3^n$ possibilities and then check that no two edges connect nodes Read More …
[Solved]: Why Turing wasn’t wrong?
Problem Detail: Computer science is a science and as a science each thesis can be refutable. So, why there is no “major” counter-thesis? After all, Einstein was a well known “genius” and has lived a long life and he has got Read More …
[Solved]: Does a DFA accept an empty string if $q_0$ is the accept state?
Problem Detail: Suppose $q_0$ is the start state, does this mean that if it’s the accept state, then the machine must accept the empty string since it cannot have a transition with the empty string? Asked By : maregor Answered By : David Read More …
[Solved]: Non-regular Languages?
Problem Detail: Possible Duplicate: How to prove that a language is not regular? Why $L_a$ and $L_b$ are not reguluar? $L_a = { e^i f^{n-i} g^j h^{n-j} : n in N, 1 leq i, j leq n }$. $L_b= {nm^{i_1} Read More …
