Question

Has the effort to confirm $\Sigma(5)$ and the search for new champions with $6$ states been stopped?

score 61 · Answer 1 · 2026-03-17 09:15:07

61

Views

Has the effort to confirm $\Sigma(5)$ and the search for new champions with $6$ states been stopped?

Published on 17 Mar 2026 - 9:15

score 113 · Answer 2 · 2026-03-18 01:58:20

113

Views

Pop-up cards Turing complete?

Published on 18 Mar 2026 - 1:58

score 165 · Answer 3 · 2026-03-18 01:45:49

165

Views

How does a cellular automaton "know" when to halt?

Published on 18 Mar 2026 - 1:45

score 417 · Answer 4 · 2026-03-17 17:38:21

417

Views

Is the halting problem also undecideable for turing machines always writing a $1$ on the tape?

Published on 17 Mar 2026 - 17:38

score 196 · Answer 5 · 2026-03-22 13:22:57

196

Views

Proof of "Extension" for Rice's Theorem

Published on 22 Mar 2026 - 13:22

score 71 · Answer 6 · 2026-03-17 08:25:31

71

Views

Do we need enumeration to find the maximal number of steps a special Turing machine can make?

Published on 17 Mar 2026 - 8:25

score 112 · Answer 7 · 2026-03-17 22:12:37

112

Views

Deciding wether a language is regular, in the arithmetic hierarchy

Published on 17 Mar 2026 - 22:12

score 115 · Answer 8 · 2026-03-17 05:26:55

115

Views

Can a machine exist making more steps than the current record, which is no busy beaver?

Published on 17 Mar 2026 - 5:26

score 151 · Answer 9 · 2026-03-17 14:59:33

151

Views

Can the halting problem for bounded Turing machines be efficiently decided?

Published on 17 Mar 2026 - 14:59

score 45 · Answer 10 · 2026-03-17 16:16:49

45

Views

Can we efficiently determine the function $f(n,s)$?

Published on 17 Mar 2026 - 16:16

score 2.8k · Answer 11 · 2026-03-20 05:12:43

2.8k

Views

Turing machine to replace consecutive 1's with 0's

Published on 20 Mar 2026 - 5:12

score 98 · Answer 12 · 2026-03-22 10:41:15

98

Views

A difficulty in understanding the operation of a Turing machine on a certain language.

Published on 22 Mar 2026 - 10:41

score 198 · Answer 13 · 2026-03-22 09:52:53

198

Views

A difficulty in understanding The implementation level description of a multi tape TM.

Published on 22 Mar 2026 - 9:52

score 1k · Answer 14 · 2026-03-21 18:16:50

1k

Views

Every non deterministic TM has an equivalent deterministic TM.

Published on 21 Mar 2026 - 18:16

score 13.8k · Answer 15 · 2026-03-22 05:40:01

13.8k

Views

Show that of Turing decidable languages is closed under concatenation.

Published on 22 Mar 2026 - 5:40

List Question

Has the effort to confirm $\Sigma(5)$ and the search for new champions with $6$ states been stopped?

Pop-up cards Turing complete?

How does a cellular automaton "know" when to halt?

Is the halting problem also undecideable for turing machines always writing a $1$ on the tape?

Proof of "Extension" for Rice's Theorem

Do we need enumeration to find the maximal number of steps a special Turing machine can make?

Deciding wether a language is regular, in the arithmetic hierarchy

Can a machine exist making more steps than the current record, which is no busy beaver?

Can the halting problem for bounded Turing machines be efficiently decided?

Can we efficiently determine the function $f(n,s)$?

Turing machine to replace consecutive 1's with 0's

A difficulty in understanding the operation of a Turing machine on a certain language.

A difficulty in understanding The implementation level description of a multi tape TM.

Every non deterministic TM has an equivalent deterministic TM.

Show that of Turing decidable languages is closed under concatenation.

Trending Questions

Popular # Hahtags

Popular Questions