Question

Is the following a good/accurate definition for an enumerator (a kind of Turing machine)?

score 140 · Answer 1 · 2020-06-05 18:00:12

140

Views

Is the following a good/accurate definition for an enumerator (a kind of Turing machine)?

Published on 05 Jun 2020 - 18:00

score 222 · Answer 2 · 2020-06-06 15:04:13

222

Views

Proving innumerable number of RE-hard languages

Published on 06 Jun 2020 - 15:04

score 28 · Answer 3 · 2020-06-08 14:17:34

28

Views

Prove that the problem of tiling a quarter of the plane of a polimino of the same type is decidable.

Published on 08 Jun 2020 - 14:17

score 159 · Answer 4 · 2020-06-12 19:58:18

159

Views

When the tape head of a TM is scanning a blank symbol, what will happen?

Published on 12 Jun 2020 - 19:58

score 112 · Answer 5 · 2026-02-23 08:32:58

112

Views

Why is the blank-tape halting problem $H_0$ so relevant in literature?

Published on 23 Feb 2026 - 8:32

score 395 · Answer 6 · 2020-06-17 13:10:30

395

Views

What is the relation between recursive languages and partial recursive functions?

Published on 17 Jun 2020 - 13:10

score 2.6k · Answer 7 · 2020-06-17 17:35:02

2.6k

Views

How do we know that the P versus NP problem is an NP problem itself?

Published on 17 Jun 2020 - 17:35

score 607 · Answer 8 · 2020-06-18 00:19:21

607

Views

What kind of problem is the membership problem of a recursive enumerable language?

Published on 18 Jun 2020 - 0:19

score 159 · Answer 9 · 2026-03-22 09:31:35

159

Views

Is a TM with oracle also a TM?

Published on 22 Mar 2026 - 9:31

score 114 · Answer 10 · 2020-06-25 22:29:58

114

Views

Turing Machine for $L = \{ a^ib^j \mid 0 \lt i \lt j \}$.

Published on 25 Jun 2020 - 22:29

score 442 · Answer 11 · 2020-06-26 18:06:45

442

Views

Alternative conditions for deciding the halting problem

Published on 26 Jun 2020 - 18:06

score 227 · Answer 12 · 2020-06-27 07:44:53

227

Views

Prove that there exists a language L ⊆ {0}^∗ that is not Turing decidable.

Published on 27 Jun 2020 - 7:44

score 160 · Answer 13 · 2020-06-27 09:55:32

160

Views

Prove there exists a Turing machine $M$ that decides an infinite subset of $HALT_{TM}$.

Published on 27 Jun 2020 - 9:55

score 64 · Answer 14 · 2020-06-29 22:23:46

64

Views

Does a r.e. language as a r.e. set assume some encoding from the set of all words to the set of natural numbers?

Published on 29 Jun 2020 - 22:23

score 56 · Answer 15 · 2026-02-23 08:32:40

56

Views

Prove decidability or undecidability of a language accepted by a turing machine.

Published on 23 Feb 2026 - 8:32

List Question

Is the following a good/accurate definition for an enumerator (a kind of Turing machine)?

Proving innumerable number of RE-hard languages

Prove that the problem of tiling a quarter of the plane of a polimino of the same type is decidable.

When the tape head of a TM is scanning a blank symbol, what will happen?

Why is the blank-tape halting problem $H_0$ so relevant in literature?

What is the relation between recursive languages and partial recursive functions?

How do we know that the P versus NP problem is an NP problem itself?

What kind of problem is the membership problem of a recursive enumerable language?

Is a TM with oracle also a TM?

Turing Machine for $L = \{ a^ib^j \mid 0 \lt i \lt j \}$.

Alternative conditions for deciding the halting problem

Prove that there exists a language L ⊆ {0}^∗ that is not Turing decidable.

Prove there exists a Turing machine $M$ that decides an infinite subset of $HALT_{TM}$.

Does a r.e. language as a r.e. set assume some encoding from the set of all words to the set of natural numbers?

Prove decidability or undecidability of a language accepted by a turing machine.

Trending Questions

Popular # Hahtags

Popular Questions