Question

Show that the Collatz Conjecture would be provable if we could solve the halting problem

score 4.5k · Answer 1 · 2017-02-24 00:40:11

4.5k

Views

Show that the Collatz Conjecture would be provable if we could solve the halting problem

Published on 24 Feb 2017 - 0:40

score 363 · Answer 2 · 2017-03-01 18:28:41

363

Views

Conjecture about the digits of $\pi$

Published on 01 Mar 2017 - 18:28

score 116 · Answer 3 · 2017-03-03 03:56:11

116

Views

Describing and visualizing what a Turing Machine does

Published on 03 Mar 2017 - 3:56

score 76 · Answer 4 · 2017-03-04 00:49:05

76

Views

Busy beaver lemma

Published on 04 Mar 2017 - 0:49

score 1.1k · Answer 5 · 2017-03-16 02:54:54

1.1k

Views

Construct a Turing Machine that accepts the following language

Published on 16 Mar 2017 - 2:54

score 352 · Answer 6 · 2017-03-19 22:23:29

352

Views

L is decidable. Prove that “similar” language is also decidable

Published on 19 Mar 2017 - 22:23

score 4.9k · Answer 7 · 2017-03-23 03:54:42

4.9k

Views

Understanding why the Halting problem can't be solved

Published on 23 Mar 2017 - 3:54

score 41 · Answer 8 · 2017-03-23 07:47:58

41

Views

Class of languages able to be recognized equal to $\text{P}/\text{poly}$?

Published on 23 Mar 2017 - 7:47

score 703 · Answer 9 · 2017-03-24 21:35:05

703

Views

Check if modified Turing Machine is equivalent to regular Turing Machine

Published on 24 Mar 2017 - 21:35

score 99 · Answer 10 · 2026-03-26 17:32:11

99

Views

Find an infinite sequence of statements so that truthness of all sequence elements is unprovable

Published on 26 Mar 2026 - 17:32

score 1.2k · Answer 11 · 2017-03-26 11:20:47

1.2k

Views

A one-tape Turing machine which operates in linear time can only recognize a regular language

Published on 26 Mar 2017 - 11:20

score 276 · Answer 12 · 2026-03-26 07:57:08

276

Views

Polynomial Time Decision Problems and P $\neq$ NP

Published on 26 Mar 2026 - 7:57

score 1.5k · Answer 13 · 2017-03-31 23:10:19

1.5k

Views

Turing Machine for comparison

Published on 31 Mar 2017 - 23:10

score 7.2k · Answer 14 · 2017-04-01 15:41:28

7.2k

Views

Design a Turing Machine which accepts word with odd length with one in the middle

Published on 01 Apr 2017 - 15:41

score 1k · Answer 15 · 2017-04-03 16:25:09

1k

Views

two tape Turing machine that accepts L = {ww | w belongs to {0,1}*} in Linear time

Published on 03 Apr 2017 - 16:25

List Question

Show that the Collatz Conjecture would be provable if we could solve the halting problem

Conjecture about the digits of $\pi$

Describing and visualizing what a Turing Machine does

Busy beaver lemma

Construct a Turing Machine that accepts the following language

L is decidable. Prove that “similar” language is also decidable

Understanding why the Halting problem can't be solved

Class of languages able to be recognized equal to $\text{P}/\text{poly}$?

Check if modified Turing Machine is equivalent to regular Turing Machine

Find an infinite sequence of statements so that truthness of all sequence elements is unprovable

A one-tape Turing machine which operates in linear time can only recognize a regular language

Polynomial Time Decision Problems and P $\neq$ NP

Turing Machine for comparison

Design a Turing Machine which accepts word with odd length with one in the middle

two tape Turing machine that accepts L = {ww | w belongs to {0,1}*} in Linear time

Trending Questions

Popular # Hahtags

Popular Questions