List questions from turing-machines

Published on 05 Nov 2022 - 6:18

65

Views

Isn't this requirement true for any Turing machine?

Published on 11 Nov 2022 - 12:20

102

Views

Why do almost all points in the unit interval have Kolmogorov complexity 1?

Published on 25 Mar 2026 - 15:59

332

Views

An argument against the logic of the halting problem proof

Published on 21 Nov 2022 - 10:27

69

Views

Prove $NOTCONTEXTFREE_{TM}$ is not recursively enumerable?

Published on 30 Mar 2026 - 0:03

484

Views

$L \subseteq \Sigma^*$ is decidable $\iff$ $I_L$ is computable

Published on 06 Dec 2022 - 23:25

49

Views

Can we prove that $L_1$ is decidable?

Published on 24 Feb 2026 - 6:47

132

Views

Decidability of the Membership problem

Published on 24 Feb 2026 - 6:47

37

Views

Turing Machine for $ = \{^n ^ c^{2^{nm}} : n,m\ge 1 \}$

Published on 17 Dec 2022 - 13:38

109

Views

If two Turing machines halt iff they find a proof that the other halts, does either of them necessarily halt?

Published on 27 Dec 2022 - 2:03

166

Views

Using non-computable numbers to compute other non-computable numbers

Published on 01 Jan 2023 - 5:18

43

Views

Proving that $P \subseteq NP,$ formally and using Turing Machines.

Published on 03 Jan 2023 - 22:26

49

Views

Can this language be decided in polynomial time?

Published on 07 Jan 2023 - 11:52

75

Views

Decidability of redundancy of axiom in classical propositional logic

Published on 09 Jan 2023 - 4:52

91

Views

Many-one reduction of $K^c$ to $A$

Published on 11 Jan 2023 - 19:35

List Question

How can there be non-computably enumerable sets in a computably enumerable degree?

Isn't this requirement true for any Turing machine?

Why do almost all points in the unit interval have Kolmogorov complexity 1?

An argument against the logic of the halting problem proof

Prove $NOTCONTEXTFREE_{TM}$ is not recursively enumerable?

$L \subseteq \Sigma^*$ is decidable $\iff$ $I_L$ is computable

Can we prove that $L_1$ is decidable?

Decidability of the Membership problem

Turing Machine for $ = \{^n ^ c^{2^{nm}} : n,m\ge 1 \}$

If two Turing machines halt iff they find a proof that the other halts, does either of them necessarily halt?

Using non-computable numbers to compute other non-computable numbers

Proving that $P \subseteq NP,$ formally and using Turing Machines.

Can this language be decided in polynomial time?

Decidability of redundancy of axiom in classical propositional logic

Many-one reduction of $K^c$ to $A$

Trending Questions

Popular # Hahtags

Popular Questions