Skip to main content
Share Your Experience: Take the 2024 Developer Survey

Explore our questions

6 votes
14 answers
6k views

Why is the Turing machine considered effective computation if it's not realizable due to the Bekenstein bound?

1 vote
1 answer
32 views

Why we can reduce $A_{TM}$ to $ALL_{CFG}$, but we can not reduce $A_{TM}$ to $E_{CFG}$

0 votes
1 answer
41 views

Why Does Computable Analysis Use Type 2 Turing Machines Over Type 1 TM's?

0 votes
1 answer
27 views

Using reducibility to prove a language that accepts $\lambda$ and either loops or accepts other strings is undecidable

1 vote
1 answer
479 views

Definition feels contradictory (Computational Complexity Theory)

71 votes
7 answers
21k views

Are there minimum criteria for a programming language being Turing complete?

0 votes
1 answer
12 views

Constraints on the order of program semantics given by an enumeration of turing-complete system programs

0 votes
1 answer
17 views

Generating all unique (tape content, head position) possibilities for a Turing Machine

3 votes
2 answers
2k views

Decidability of the language that accepts a universal turing machine

0 votes
1 answer
105 views

Computation branches on NTM

3 votes
0 answers
20 views

Fastest possible (direct?) simulation of one tape turing machines by a small one tape Universal Turing Machine

0 votes
2 answers
2k views

Show that ALL DFA is decidable

0 votes
0 answers
139 views

Turing Machine transition table for checking a palindrome

0 votes
1 answer
1k views

Show that an instance of PCP or MPCP has no solutions

Browse more Questions