Question

Completeness of the Reals (Tarski's Theorem)

score 241 · Answer 1 · 2021-07-29 03:28:32

241

Views

Completeness of the Reals (Tarski's Theorem)

Published on 29 Jul 2021 - 3:28

score 88 · Answer 2 · 2026-02-23 13:40:58

88

Views

Transcendental numbers are decidable: a proof?

Published on 23 Feb 2026 - 13:40

score 77 · Answer 3 · 2021-08-18 12:25:59

77

Views

Is every axiomatizable theory $T$ countable?

Published on 18 Aug 2021 - 12:25

score 1.3k · Answer 4 · 2021-08-21 14:10:46

1.3k

Views

Why is "decidable" included in "Turing-recognizable"?

Published on 21 Aug 2021 - 14:10

score 153 · Answer 5 · 2021-08-21 19:31:21

153

Views

Essential undecidability of binary string arithmetic

Published on 21 Aug 2021 - 19:31

score 42 · Answer 6 · 2021-08-30 04:54:39

42

Views

Could the decidability of a theorem be undecidable?

Published on 30 Aug 2021 - 4:54

score 81 · Answer 7 · 2021-10-03 04:16:02

81

Views

What background do I need to know to understand the paper published by Alan Turing mentioning the halting problem?

Published on 03 Oct 2021 - 4:16

score 215 · Answer 8 · 2021-10-09 16:26:46

215

Views

Bijection between $2^{\Sigma^*}$ and $\mathbb R$

Published on 09 Oct 2021 - 16:26

score 459 · Answer 9 · 2021-10-14 18:03:09

459

Views

Decidability of DCFL and Undecidability of CFL with respect to regularity

Published on 14 Oct 2021 - 18:03

score 1.4k · Answer 10 · 2021-10-16 12:38:45

1.4k

Views

Why is "Turing machine makes no left move" decidable?

Published on 16 Oct 2021 - 12:38

score 65 · Answer 11 · 2026-02-23 15:04:36

65

Views

Must every Turing-complete language be able to enumerate precisely those algorithms which return a particular value?

Published on 23 Feb 2026 - 15:04

score 111 · Answer 12 · 2021-10-31 22:06:58

111

Views

Is this modified characteristic function computable?

Published on 31 Oct 2021 - 22:06

score 674 · Answer 13 · 2021-11-09 20:19:02

674

Views

Show the projection of decidable language is Turing-recognizable

Published on 09 Nov 2021 - 20:19

score 930 · Answer 14 · 2021-11-11 04:33:59

930

Views

Why does Alan Turing proof of the halting problem is considered a proof that mathematics is undecidable?

Published on 11 Nov 2021 - 4:33

score 378 · Answer 15 · 2021-11-11 04:57:29

378

Views

Simple concrete example of a language that is Turing recognizable but not decidable

Published on 11 Nov 2021 - 4:57

List Question

Completeness of the Reals (Tarski's Theorem)

Transcendental numbers are decidable: a proof?

Is every axiomatizable theory $T$ countable?

Why is "decidable" included in "Turing-recognizable"?

Essential undecidability of binary string arithmetic

Could the decidability of a theorem be undecidable?

What background do I need to know to understand the paper published by Alan Turing mentioning the halting problem?

Bijection between $2^{\Sigma^*}$ and $\mathbb R$

Decidability of DCFL and Undecidability of CFL with respect to regularity

Why is "Turing machine makes no left move" decidable?

Must every Turing-complete language be able to enumerate precisely those algorithms which return a particular value?

Is this modified characteristic function computable?

Show the projection of decidable language is Turing-recognizable

Why does Alan Turing proof of the halting problem is considered a proof that mathematics is undecidable?

Simple concrete example of a language that is Turing recognizable but not decidable

Trending Questions

Popular # Hahtags

Popular Questions