Linked Questions

149 votes
4 answers
21k views

We were given the following exercise. Let $\qquad \displaystyle f(n) = \begin{cases} 1 & 0^n \text{ occurs in the decimal representation of } \pi \\ 0 & \text{else}\end{cases}$ ...
Raphael's user avatar
  • 73.4k
17 votes
9 answers
7k views

I have this [kind of funny] question in mind. Why is the non-deterministic finite automaton called non-deterministic while we define the transitions for inputs. Well, even though there are multiple ...
Madhusoodan P's user avatar
28 votes
5 answers
18k views

In many textbooks NP problems are defined as: Set of all decision problems solvable by non deterministic algorithms in polynomial time I couldn't understand the part "solvable by non deterministic ...
user5507's user avatar
  • 2,251
13 votes
4 answers
11k views

What is differences between deterministic and nondeterministic Turing machines? Different but equivalent models of NDTM. In particular, what is this frequently used phrase "nondeterministically guess"?...
fade2black's user avatar
  • 9,895
15 votes
4 answers
1k views

I realize non-deterministic pushdown automata can be an improvement over deterministic ones as they can "choose" among several states and there are some context-free languages which cannot be accepted ...
lisa's user avatar
  • 253
6 votes
4 answers
9k views

I was asked if my computer program (in Java) was deterministic. I'm wondering how could it be not? There is no such thing as a non-deterministic Java program right? Even if I use a random number ...
TV Mohini's user avatar
  • 161
15 votes
3 answers
1k views

Theory of computation often involves nondeterministic models of computation. Some examples include nondeterministic finite automata (NFAs), nondeterministic pushdown automata (PDAs), and ...
Yuval Filmus's user avatar
1 vote
4 answers
323 views

A nondeterministic automaton, after reading an input symbol at some state, may jump into any of a (finite?) number of states. Does the automaton uniformly randomly choose one out of the several ...
Tim's user avatar
  • 5,045
1 vote
2 answers
9k views

( This may be related to NFAs with more than one initial state ) Consider a dfa $M$ with alphabet $\Sigma$ and states $Q$, typically also characterized by a specific initial state $q_0\in Q$. As the ...
John Forkosh's user avatar
5 votes
3 answers
2k views

A nondeterministic machine trying to decide membership in a language is presented with a hint (called a "witness" or "certificate") which proves membership (no such witness is provided for ...
Ingrid Morstrad's user avatar
7 votes
3 answers
550 views

In Sipser's textbook "Introduction to the Theory of Computation, Second Edition," he defines nondeterministic time complexity as follows: Let $N$ be a nondeterministic Turing machine that is a ...
templatetypedef's user avatar
9 votes
2 answers
1k views

This is a very basic question but I spent some time reading and find no answer. I am not computer science majored but have read some basic algorithm stuff, for example, some basic sorting algorithms ...
chichi's user avatar
  • 193
2 votes
2 answers
957 views

I'm just starting my second year in computer science and one of my classes briefly touched upon deterministic vs. non-deterministic algorithms. This got me thinking - is there any use for algorithms ...
Jules's user avatar
  • 632
2 votes
1 answer
1k views

I read the term "non-deterministic algorithm" in many places but I don't see how an algorithm can be truly non-deterministic. Typically, there is some source of randomness in these algorithms. If the ...
Ajoy Bhatia's user avatar
4 votes
1 answer
475 views

I have some questions regarding the exact nature of non-deterministic algorithms. Is it right that non-deterministic algorithms do not rely on any randomness whatsoever? In which case, this Wikipedia ...
Schmetterling's user avatar

15 30 50 per page