List questions from turing-machines

Published on 23 Feb 2026 - 13:33

143

Views

First value of the second order busy beaver function?

Published on 26 Mar 2026 - 7:57

312

Views

Show that this language is undecidable

Published on 23 Feb 2026 - 21:11

511

Views

Show that the following language is decidable by finding the algorithm for the finite automaton

Published on 23 Feb 2026 - 21:15

167

Views

How to show that this language is decidable

Published on 23 Feb 2026 - 21:13

924

Views

If L1 is decidable and if L2 is included in L1, is L2 also decidable?

Published on 23 Feb 2026 - 22:51

205

Views

How to show that this language is Turing recognizable

Published on 23 Feb 2026 - 22:46

97

Views

Can we give an equivalent definition for computable numbers without mentioning turing machines?

Published on 30 Nov 2020 - 4:21

92

Views

Does proof of FOL undecidability require tacit appeal to the Church-Turing Thesis?

Published on 01 Dec 2020 - 21:05

127

Views

Why is it enough to test only the words up to length n ( number of state) in the given algorithm for a decidability problem

Published on 23 Feb 2026 - 22:51

52

Views

Two problems related to NP-Hard and why they are true?

Published on 28 Mar 2026 - 8:49

194

Views

Is $L=\{\,a^ib^jc^k \mid i=2j=3k\, \}$ a Turing language?

Published on 29 Mar 2026 - 14:07

460

Views

Construct a TM to show that {<G,s,t,k> | G is a directed graph with path length $\le$ k from s to t} is in class P

Published on 28 Mar 2026 - 10:41

25

Views

Incompleteness of semi recursive languages

Published on 06 Dec 2020 - 21:14

122

Views

Let $f$ be a computable and injective function. Is $f^{-1}$ computable and injective?

Published on 23 Feb 2026 - 22:48

List Question

Best approach for Undecidability proof

First value of the second order busy beaver function?

Show that this language is undecidable

Show that the following language is decidable by finding the algorithm for the finite automaton

How to show that this language is decidable

If L1 is decidable and if L2 is included in L1, is L2 also decidable?

How to show that this language is Turing recognizable

Can we give an equivalent definition for computable numbers without mentioning turing machines?

Does proof of FOL undecidability require tacit appeal to the Church-Turing Thesis?

Why is it enough to test only the words up to length n ( number of state) in the given algorithm for a decidability problem

Two problems related to NP-Hard and why they are true?

Is $L=\{\,a^ib^jc^k \mid i=2j=3k\, \}$ a Turing language?

Construct a TM to show that {<G,s,t,k> | G is a directed graph with path length $\le$ k from s to t} is in class P

Incompleteness of semi recursive languages

Let $f$ be a computable and injective function. Is $f^{-1}$ computable and injective?

Trending Questions

Popular # Hahtags

Popular Questions