List questions from turing-machines | MathQA

Can you prove that the difference of these two undecidable sets is un/decidable?

Published on 24 Feb 2026 - 8:20

Turing machine problem.

Published on 19 Jan 2023 - 0:27

Is there a lower bound on the rate of growth of distinct algorithms (vs. description size) in a Turing-complete system?

Published on 25 Mar 2026 - 20:36

Language of all graphs that have diameter larger than $\frac{n}{2}$

Published on 21 Jan 2023 - 16:20

It is possible to show ($HALT_{TM}$ is decidable $\Rightarrow A_{TM}$ is decidable), but how about the converse?

Published on 24 Feb 2026 - 8:21

Does every reachable state in all Turing-complete computational models have infinitely many potential ancestor states?

Published on 24 Jan 2023 - 0:27

Proving a function is primitive recursive using nonatomic functions

Published on 25 Jan 2023 - 17:47

What does it mean for a language L to be recognisable in polynomial time?

Published on 28 Jan 2023 - 20:01