1. Given a Turing Machine T , are there any input strings on which T loops forever? 2. Given a Turing Machine T and a string w, does T reject input w?

score 113 · Answer 14 · 2022-02-07 09:46:47

113

Views

Can membership in a well-defined set be undecidable?

Published on 07 Feb 2022 - 9:46

score 466 · Answer 15 · 2022-02-13 07:48:10

466

Views

Show that $B$ is decidable

Published on 13 Feb 2022 - 7:48

List Question

Every infinite Turing-recognizable language has an infinite decidable subset

Proof that the Post Correspondence Problem is undecidable

Multitape Turing Machine - Check input's primality

Help me understand decidability of an axiom system of a theory

Why is Q (Robinson arithmetic) both undecidable and axiomatizable?

Using diagonalization approach, how to show the existence of at least one set of natural numbers that is not computable?

Is the decidability of all possible axiomatizations equivalent to decidability?

Are the algebraic real numbers an automatic structure?

How to show that if there's a mapping reduction from L to its complement, it doesn't imply that L∈R?

The range of a non-computable function that grows faster than computable functions is undecidable

Show a theory $\Theta$ is complete.

Satisfiability of Second-Order Logic: Is this Decision Problem Complete for Some Level of the Arithmetical Hierarchy?

1. Given a Turing Machine T , are there any input strings on which T loops forever? 2. Given a Turing Machine T and a string w, does T reject input w?

Can membership in a well-defined set be undecidable?

Show that $B$ is decidable

Trending Questions

Popular # Hahtags

Popular Questions