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

1 vote
1 answer
46 views

What are the differences between Oracle Turing Machine and PAC?

1 vote
2 answers
43 views

Why is $A_{TM}$ not mapping reducible to $E_{TM}$?

0 votes
1 answer
81 views

Copy operation in under 9 states?

2 votes
1 answer
113 views

Disprove: if L is decidable then Prefix(L) is decidable

9 votes
1 answer
2k views

Compiler that compiles to a Turing machine?

2 votes
2 answers
53 views

Is the problem of "DFA-TM-INCLUSION" recursively enumerable?

1 vote
2 answers
48 views

Since there is no such thing as infinite memory, can we say that all pushdown automata and Turing machines are actually very big DFA?

1 vote
0 answers
20 views

Showing that $ASPACE(f (n)) = DTIME(2^{O(f (n))})$

0 votes
0 answers
30 views

Translate det. Turingmachine into formula

0 votes
0 answers
13 views

Left and right derivation of Turing Machine

0 votes
1 answer
18 views

Construction of a Turing Machine that accepts the language of (a^nb^nc^md^m for) m,n >= 1

0 votes
1 answer
51 views

kolmogorov complexity for finite Language?

1 vote
1 answer
87 views

Language of Turing machines that go through some configuration infinitely many times on empty input

1 vote
1 answer
66 views

Constant-time adding an element?

Browse more Questions