Applying Reflexivity of String Equivalence in Agda Proofs...
Read MoreAre linear problems on rational numbers decidable in Z3?...
Read MoreZ3: is Nonlinear integer arithmetic undecidable or semi-decidable...
Read MoreProve that we can decide whether a Turing machine takes at least 100 steps on some input...
Read MoreUndecidable if TM overwrites its input?...
Read MoreRecursive vs recursively enumerable language in Turing Machines?...
Read MoreLooking for the Agda module that contains decidable equality for lists...
Read MoreHow to define a subformula of an inductively defined type in Agda?...
Read MoreRelationship between NP-hard and undecidable problems...
Read MoreWhy knowing whether some piece of memory is needed is undecidable?...
Read MoreWorking within agda's decideability framework...
Read MoreWhether a context free language is deterministic context free language...
Read MoreFirst order logic in practice, how to deal with undecidablity?...
Read MoreIs there a non-RE language that is composed of only 1 element?...
Read MoreSomething is not computable, can it be co-recursively enumerable?...
Read MoreIs the language {⟨A⟩∣A is an NFA and L(A)={0,1}∗} decidable? decidable?...
Read MoreDecidability of "Is n divisible with 23?"...
Read MoreTuring machine decidability ambiguous cases...
Read MoreExactly what quantifiers is SMT complete for?...
Read MoreCheck whether 2 languages are Turing recognizable or co-Turing recognizable...
Read MoreHave a decider decides {<M>|M is TM and |L(M)|=n}, build a decider decides n-1...
Read MoreDoes the order of prenex quantification matter in EPR fragment?...
Read MoreShow that the language is decidable...
Read MoreProve whether this language is decidable and recognizable...
Read MoreWhy is E(dfa) a decidable language?...
Read MoreProve whether this language is decidable or undecidable...
Read MoreLean complains it can't see that a statement is decidable...
Read MoreCannot create algorithm for decidable language...
Read MoreProving decidability of subset in Agda...
Read More