Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.

Sign up to join this community
Anybody can ask a question
Anybody can answer
The best answers are voted up and rise to the top

Explore our questions

0 votes
1 answer
36 views

Decidable or Not: Set of all Turing Machines M that on input w uses all states of M

-2 votes
0 answers
28 views

Why can recursion theorem be used to get own description?

1 vote
1 answer
49 views

Turing Machine, UNLIMITED number of steps left or right on the tape?

3 votes
3 answers
221 views

Why we cannot prove that a computable function is total?

0 votes
0 answers
23 views

How to think about blank symbol when Turing Machine used as a function?

0 votes
2 answers
1k views

In an NFA, what if there are no transitions out of an accept state but there are symbols left in the string?

0 votes
0 answers
29 views

Equivalence for Turing Machines is not Recognizable - Reduction DOUBT

0 votes
1 answer
39 views

Is a problem in NP if it runs in P time on a NDTM, verifiable in P on a DTM, but solution doesn’t halt on a DTM?

0 votes
1 answer
69 views

Computation branches on NTM

0 votes
2 answers
472 views

Show that ALL DFA is decidable

0 votes
1 answer
67 views

How to build a DFA that recognizes a language

0 votes
1 answer
738 views

Show that an instance of PCP or MPCP has no solutions

4 votes
1 answer
63 views

Self referential hash function possible?

0 votes
0 answers
19 views

Order of time complexity in computing $R\sin(2\alpha)$ VS $2R\sin(\alpha)\cos(\alpha)$

Browse more Questions