Question

How Wang's conjecture implies decidability of The Domino Problem?

score 171 · Answer 1 · 2019-01-21 21:31:47

171

Views

How Wang's conjecture implies decidability of The Domino Problem?

Published on 21 Jan 2019 - 21:31

score 277 · Answer 2 · 2019-01-27 18:00:13

277

Views

Why does the unsolvability of the Halting Problem give a negative solution to the decision problem?

Published on 27 Jan 2019 - 18:00

score 120 · Answer 3 · 2019-01-31 10:15:23

120

Views

Specify a decisive Turing machine that calculates the following function $f$.

Published on 31 Jan 2019 - 10:15

score 59 · Answer 4 · 2019-02-12 23:13:10

59

Views

Symbols of the language vs. Free variables

Published on 12 Feb 2019 - 23:13

score 121 · Answer 5 · 2019-02-13 00:54:25

121

Views

Can we enumerate finite sequences which have no halting continuation?

Published on 13 Feb 2019 - 0:54

score 137 · Answer 6 · 2019-02-22 10:26:47

137

Views

Weakened versions of Word and Isomorphism Problems in group theory

Published on 22 Feb 2019 - 10:26

score 4.1k · Answer 7 · 2019-02-25 04:09:13

4.1k

Views

Difference of two decidable languages?

Published on 25 Feb 2019 - 4:09

score 168 · Answer 8 · 2019-02-26 21:22:11

168

Views

Why can't the sequent calculus for First-Order Classical Logic be used for proving decidability via Proof-search?

Published on 26 Feb 2019 - 21:22

score 184 · Answer 9 · 2019-03-22 01:14:19

184

Views

Model Theoretical Interpretation of the Incompleteness of Number Theory

Published on 22 Mar 2019 - 1:14

score 79 · Answer 10 · 2019-04-11 19:24:28

79

Views

Is intuitionistic first-order logic with no function or relation symbols decidable?

Published on 11 Apr 2019 - 19:24

score 148 · Answer 11 · 2019-04-12 00:48:27

148

Views

Show that the decision problem for implication is solvable if and only if the decision problem for validity is solvable

Published on 12 Apr 2019 - 0:48

score 1.7k · Answer 12 · 2019-04-14 18:48:35

1.7k

Views

Prove that the following language is decidable / undecidable

Published on 14 Apr 2019 - 18:48

score 128 · Answer 13 · 2019-04-17 02:30:02

128

Views

Decidability of Gödel sentences.

Published on 17 Apr 2019 - 2:30

score 134 · Answer 14 · 2019-04-30 16:44:09

134

Views

Classify Turing Machine as Decidable, Co-recognizable, Recognizable

Published on 30 Apr 2019 - 16:44

score 205 · Answer 15 · 2019-05-02 04:24:05

205

Views

Proving undecidability of group isomorphism problem from an unsolvable word problem

Published on 02 May 2019 - 4:24

List Question

How Wang's conjecture implies decidability of The Domino Problem?

Why does the unsolvability of the Halting Problem give a negative solution to the decision problem?

Specify a decisive Turing machine that calculates the following function $f$.

Symbols of the language vs. Free variables

Can we enumerate finite sequences which have no halting continuation?

Weakened versions of Word and Isomorphism Problems in group theory

Difference of two decidable languages?

Why can't the sequent calculus for First-Order Classical Logic be used for proving decidability via Proof-search?

Model Theoretical Interpretation of the Incompleteness of Number Theory

Is intuitionistic first-order logic with no function or relation symbols decidable?

Show that the decision problem for implication is solvable if and only if the decision problem for validity is solvable

Prove that the following language is decidable / undecidable

Decidability of Gödel sentences.

Classify Turing Machine as Decidable, Co-recognizable, Recognizable

Proving undecidability of group isomorphism problem from an unsolvable word problem

Trending Questions

Popular # Hahtags

Popular Questions