Computer Science Stack Exchange

1 vote

1 answer

39 views

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

John L.

36.7k

modified 14 hours ago

1 vote

1 answer

241 views

How To Show That B is Semi-Decidable Given A

CommunityBot

1

modified 14 hours ago

0 votes

0 answers

20 views

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

Oleg Dats

299

asked yesterday

0 votes

0 answers

26 views

Equivalence for Turing Machines is not Recognizable - Reduction DOUBT

Nicola

3

modified Jan 24 at 14:55

0 votes

1 answer

40 views

how to decide this language

CommunityBot

1

modified Jan 24 at 1:02

0 votes

1 answer

36 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?

J Jackson

3

modified Jan 23 at 22:23

0 votes

1 answer

19 views

Decidability of the minimum number of states a Turing Machine needs to accept a language

D.W.♦

148k

answered Jan 23 at 18:28

0 votes

1 answer

68 views

Computation branches on NTM

CommunityBot

1

modified Jan 23 at 14:02

0 votes

2 answers

462 views

Show that ALL DFA is decidable

CommunityBot

1

modified Jan 22 at 23:04

0 votes

1 answer

100 views

Show that both set A and set B are Turing reducible to some mixture of A and B

CommunityBot

1

modified Jan 22 at 13:03

0 votes

1 answer

726 views

Show that an instance of PCP or MPCP has no solutions

CommunityBot

1

modified Jan 22 at 8:00

0 votes

1 answer

766 views

Determine if a language is Decidable or semi decidable

CommunityBot

1

modified Jan 18 at 10:03

1 vote

1 answer

78 views

What are the differences between Oracle Turing Machine and PAC?

CommunityBot

1

modified Jan 15 at 21:01

0 votes

0 answers

20 views

Are all languages determined in exponential time NP languages?

lz9866

163

asked Jan 15 at 15:18

Stack Exchange Network

Explore our questions

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

How To Show That B is Semi-Decidable Given A

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

Equivalence for Turing Machines is not Recognizable - Reduction DOUBT

how to decide this language

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?

Decidability of the minimum number of states a Turing Machine needs to accept a language

Computation branches on NTM

Show that ALL DFA is decidable

Show that both set A and set B are Turing reducible to some mixture of A and B

Show that an instance of PCP or MPCP has no solutions

Determine if a language is Decidable or semi decidable

What are the differences between Oracle Turing Machine and PAC?

Are all languages determined in exponential time NP languages?

Hot Network Questions