Applying Reflexivity of String Equivalence in Agda Proofs...

Are linear problems on rational numbers decidable in Z3?...

Z3: is Nonlinear integer arithmetic undecidable or semi-decidable...

Prove that we can decide whether a Turing machine takes at least 100 steps on some input...

Undecidable if TM overwrites its input?...

Recursive vs recursively enumerable language in Turing Machines?...

Looking for the Agda module that contains decidable equality for lists...

How to define a subformula of an inductively defined type in Agda?...

Relationship between NP-hard and undecidable problems...

Why knowing whether some piece of memory is needed is undecidable?...

Turing machines and decidability...

Working within agda's decideability framework...

Whether a context free language is deterministic context free language...

First order logic in practice, how to deal with undecidablity?...

Is there a non-RE language that is composed of only 1 element?...

Something is not computable, can it be co-recursively enumerable?...

Is the language {⟨A⟩∣A is an NFA and L(A)={0,1}∗} decidable? decidable?...

Decidability of "Is n divisible with 23?"...

Turing machine decidability ambiguous cases...

Exactly what quantifiers is SMT complete for?...

Check whether 2 languages are Turing recognizable or co-Turing recognizable...

Have a decider decides {<M>|M is TM and |L(M)|=n}, build a decider decides n-1...

Does the order of prenex quantification matter in EPR fragment?...

Show that the language is decidable...

Prove whether this language is decidable and recognizable...

Why is E(dfa) a decidable language?...

Prove whether this language is decidable or undecidable...

Lean complains it can't see that a statement is decidable...

Cannot create algorithm for decidable language...

Proving decidability of subset in Agda...