Question

What this language mean? I have to define a Turing machine for it.

score 87 · Answer 1 · 2020-07-10 15:22:27

87

Views

What this language mean? I have to define a Turing machine for it.

Published on 10 Jul 2020 - 15:22

score 104 · Answer 2 · 2020-07-26 03:39:54

104

Views

Analogue of Turing recognizable languages

Published on 26 Jul 2020 - 3:39

score 126 · Answer 3 · 2020-07-27 19:34:57

126

Views

Are "forgetful" and "mindful" Turing machines equivalent?

Published on 27 Jul 2020 - 19:34

score 221 · Answer 4 · 2020-07-28 13:25:19

221

Views

Are Turing machines that move before assigning Turing complete?

Published on 28 Jul 2020 - 13:25

score 58 · Answer 5 · 2016-07-08 09:31:33

58

Views

Is $\{\langle M \rangle \mid \exists K \forall w\; \text{M(w) halt with less than K steps}\} \in RE$?

Published on 08 Jul 2016 - 9:31

score 42 · Answer 6 · 2016-07-08 13:32:26

42

Views

Is $\{\langle M \rangle \mid \exists P \;\text{(p is polynom)}\; \forall w\; \text{M(w) halt with less than p(|w|) steps}\} \in RE$?

Published on 08 Jul 2016 - 13:32

score 980 · Answer 7 · 2016-07-12 03:18:24

980

Views

By what measure does the busy beaver function grow faster than any computable function?

Published on 12 Jul 2016 - 3:18

score 779 · Answer 8 · 2016-07-15 20:18:56

Is there a language not in NP but for which exists a Non-deterministic TM which accepts/rejects strings based on belonging to the language?

score 313 · Answer 9 · 2016-07-16 20:38:16

313

Views

I understand Turing Machine things about languages but I don't understand same things about problems and their inputs

Published on 16 Jul 2016 - 20:38

score 757 · Answer 10 · 2016-07-30 07:38:11

757

Views

Non-deterministic 2-tape Turing Machine to accept the language $L=\{x\#y \mid x,y \in \{0,1\}^\star, x \text{ is contained in } y\}$

Published on 30 Jul 2016 - 7:38

score 788 · Answer 11 · 2016-08-12 22:00:10

788

Views

Describe a non-deterministic 2-tape Turing machine

Published on 12 Aug 2016 - 22:00

score 1.2k · Answer 12 · 2026-03-26 07:40:33

1.2k

Views

Concurrent Neural Network - Enabling Currying

Published on 26 Mar 2026 - 7:40

score 97 · Answer 13 · 2016-08-23 16:58:19

97

Views

Why do we get a contradiction for $x=n$?

Published on 23 Aug 2016 - 16:58

score 195 · Answer 14 · 2016-09-04 21:42:45

195

Views

SAT $O(\log n)$ SAT oracle queries?

Published on 04 Sep 2016 - 21:42

score 190 · Answer 15 · 2026-03-26 01:07:33

190

Views

What is the difference between a quantum turing machine and a non-deterministic turing machine?

Published on 26 Mar 2026 - 1:07

List Question

What this language mean? I have to define a Turing machine for it.

Analogue of Turing recognizable languages

Are "forgetful" and "mindful" Turing machines equivalent?

Are Turing machines that move before assigning Turing complete?

Is $\{\langle M \rangle \mid \exists K \forall w\; \text{M(w) halt with less than K steps}\} \in RE$?

Is $\{\langle M \rangle \mid \exists P \;\text{(p is polynom)}\; \forall w\; \text{M(w) halt with less than p(|w|) steps}\} \in RE$?

By what measure does the busy beaver function grow faster than any computable function?

Is there a language not in NP but for which exists a Non-deterministic TM which accepts/rejects strings based on belonging to the language?

I understand Turing Machine things about languages but I don't understand same things about problems and their inputs

Non-deterministic 2-tape Turing Machine to accept the language $L=\{x\#y \mid x,y \in \{0,1\}^\star, x \text{ is contained in } y\}$

Describe a non-deterministic 2-tape Turing machine

Concurrent Neural Network - Enabling Currying

Why do we get a contradiction for $x=n$?

SAT $O(\log n)$ SAT oracle queries?

What is the difference between a quantum turing machine and a non-deterministic turing machine?

Trending Questions

Popular # Hahtags

Popular Questions