Question

How many digits of Chaitin's $\Omega$ constant would we know if we had a $\Sigma_1$-Oracle?

score 307 · Answer 1 · 2026-03-25 08:01:51

307

Views

How many digits of Chaitin's $\Omega$ constant would we know if we had a $\Sigma_1$-Oracle?

Published on 25 Mar 2026 - 8:01

score 2.2k · Answer 2 · 2013-03-26 19:13:09

2.2k

Views

Turing machine for balancing parentheses on a two letter alphabet

Published on 26 Mar 2013 - 19:13

score 3k · Answer 3 · 2013-03-28 05:04:56

3k

Views

Turing Machine Variation

Published on 28 Mar 2013 - 5:04

score 1.9k · Answer 4 · 2013-03-28 09:01:50

1.9k

Views

Is this undecidable language recognizable?

Published on 28 Mar 2013 - 9:01

score 233 · Answer 5 · 2013-03-28 20:50:15

233

Views

Non-Deterministic Turing Machine Algorithm

Published on 28 Mar 2013 - 20:50

score 31 · Answer 6 · 2026-03-25 22:04:00

31

Views

How is any algorithm expressed respectively by a grammar, a Turing machine and last but not least a rule-based system?

Published on 25 Mar 2026 - 22:04

score 196 · Answer 7 · 2020-08-07 10:40:52

196

Views

Undecidability of the Halting Problem excluding the main diagonal

Published on 07 Aug 2020 - 10:40

score 115 · Answer 8 · 2020-08-14 04:21:47

115

Views

Can a Busy Beaver have duplicate transitions

Published on 14 Aug 2020 - 4:21

score 183 · Answer 9 · 2026-02-23 19:22:37

183

Views

Prove that: For each language L that is accepted by a DTM in polynomial time, there is also a DTM M′ that decides L in polynomial time.

Published on 23 Feb 2026 - 19:22

score 126 · Answer 10 · 2026-03-28 19:30:47

126

Views

Does Gödel’s theorem preclude the existence of all means of proving all statements in a formal system, or preclude only computable means?

Published on 28 Mar 2026 - 19:30

score 92 · Answer 11 · 2020-08-28 07:26:28

92

Views

Has something like the Turing Machine that halts if ZFC is inconsistent been done for other axiom systems?

Published on 28 Aug 2020 - 7:26

score 82 · Answer 12 · 2026-02-23 19:24:02

82

Views

Given a TM T , is there an input string that causes T to enter every one of its nonhalting states?

Published on 23 Feb 2026 - 19:24

score 86 · Answer 13 · 2026-03-25 13:53:00

86

Views

Totally order turing machines by halting

Published on 25 Mar 2026 - 13:53

score 490 · Answer 14 · 2026-03-28 18:14:18

490

Views

I'm probably wrong about Curry-Howard

Published on 28 Mar 2026 - 18:14

score 212 · Answer 15 · 2026-03-25 13:54:06

212

Views

Can theories with axioms beyond arithmetic make false promises about integer existence?

Published on 25 Mar 2026 - 13:54

List Question

How many digits of Chaitin's $\Omega$ constant would we know if we had a $\Sigma_1$-Oracle?

Turing machine for balancing parentheses on a two letter alphabet

Turing Machine Variation

Is this undecidable language recognizable?

Non-Deterministic Turing Machine Algorithm

How is any algorithm expressed respectively by a grammar, a Turing machine and last but not least a rule-based system?

Undecidability of the Halting Problem excluding the main diagonal

Can a Busy Beaver have duplicate transitions

Prove that: For each language L that is accepted by a DTM in polynomial time, there is also a DTM M′ that decides L in polynomial time.

Does Gödel’s theorem preclude the existence of all means of proving all statements in a formal system, or preclude only computable means?

Has something like the Turing Machine that halts if ZFC is inconsistent been done for other axiom systems?

Given a TM T , is there an input string that causes T to enter every one of its nonhalting states?

Totally order turing machines by halting

I'm probably wrong about Curry-Howard

Can theories with axioms beyond arithmetic make false promises about integer existence?

Trending Questions

Popular # Hahtags

Popular Questions