Question

Length of the longest non-infinite path given by a pattern of length n.

score 141 · Answer 1 · 2023-10-10 08:10:43

141

Views

Length of the longest non-infinite path given by a pattern of length n.

Published on 10 Oct 2023 - 8:10

score 121 · Answer 2 · 2023-10-10 23:05:48

121

Views

is the normal proof of halting problem undecidability is wrong?

Published on 10 Oct 2023 - 23:05

score 69 · Answer 3 · 2026-02-23 13:40:32

69

Views

Problems with universal encoding format for Turing Machines?

Published on 23 Feb 2026 - 13:40

score 63 · Answer 4 · 2023-10-26 22:25:52

63

Views

Union of complement of P and Q is in coNP

Published on 26 Oct 2023 - 22:25

score 58 · Answer 5 · 2023-11-14 02:59:29

58

Views

Is the halting set a subset of the natural numbers?

Published on 14 Nov 2023 - 2:59

score 131 · Answer 6 · 2023-11-15 20:51:09

131

Views

No Turing machine can detect whether another Turing machine will halt in all cases. But exactly how well can one do?

Published on 15 Nov 2023 - 20:51

score 48 · Answer 7 · 2023-11-22 20:25:10

48

Views

Showing that the language of this constrained form of the PCP is decidable

Published on 22 Nov 2023 - 20:25

score 108 · Answer 8 · 2026-03-26 19:17:00

108

Views

Why is reduction from Hamiltonian cycle to Hamiltonian path wrong?

Published on 26 Mar 2026 - 19:17

score 246 · Answer 9 · 2023-11-27 17:12:54

246

Views

Multi-head Turing machine can be simulated by a single-tape deterministic Turing machine

Published on 27 Nov 2023 - 17:12

score 151 · Answer 10 · 2023-12-01 05:44:10

151

Views

Second place in the Turing Machine race

Published on 01 Dec 2023 - 5:44

score 92 · Answer 11 · 2026-02-23 13:43:11

92

Views

Help understanding the proof that $L = \{ \langle M \rangle \mid M \text{ is a TM that accepts the input string } 101\}$ is undecidable

Published on 23 Feb 2026 - 13:43

score 43 · Answer 12 · 2026-02-23 13:40:37

43

Views

Clocked Turing Machine in Undecidability proofs

Published on 23 Feb 2026 - 13:40

score 56 · Answer 13 · 2023-12-10 18:01:14

56

Views

Is this a valid Busy Beaver lower bound and does it help?

Published on 10 Dec 2023 - 18:01

score 36 · Answer 14 · 2023-12-13 10:49:26

36

Views

Variant of a Turing machine

Published on 13 Dec 2023 - 10:49

score 73 · Answer 15 · 2023-12-14 08:42:58

73

Views

What are provers and verifiers in computation theory?

Published on 14 Dec 2023 - 8:42

List Question

Length of the longest non-infinite path given by a pattern of length n.

is the normal proof of halting problem undecidability is wrong?

Problems with universal encoding format for Turing Machines?

Union of complement of P and Q is in coNP

Is the halting set a subset of the natural numbers?

No Turing machine can detect whether another Turing machine will halt in all cases. But exactly how well can one do?

Showing that the language of this constrained form of the PCP is decidable

Why is reduction from Hamiltonian cycle to Hamiltonian path wrong?

Multi-head Turing machine can be simulated by a single-tape deterministic Turing machine

Second place in the Turing Machine race

Help understanding the proof that $L = \{ \langle M \rangle \mid M \text{ is a TM that accepts the input string } 101\}$ is undecidable

Clocked Turing Machine in Undecidability proofs

Is this a valid Busy Beaver lower bound and does it help?

Variant of a Turing machine

What are provers and verifiers in computation theory?

Trending Questions

Popular # Hahtags

Popular Questions