Mathlib Map

Theorems · Theorem · logic and foundations

ComputablePred.halting_problem_re

∀ (n : ℕ), REPred fun c => (c.eval n).Dom

The Halting problem is recursively enumerable

Defined in
Mathlib.Computability.Halting
Cited by
1 results in Mathlib
Foundations
Depth 100 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

ComputablePred.halting_problem_not_re · cited by 0ComputablePred.halting_pr…Part.Dom · cited by 145Part.DomNat.Partrec.Code · cited by 66Partrec.CodeNat.Partrec.Code.eval · cited by 25Code.evalComputable.const · cited by 16Computable.constPartrec₂.comp · cited by 8Partrec₂.compComputable.id · cited by 8Computable.idREPred · cited by 7REPredNat.Partrec.Code.eval_part · cited by 5Code.eval_partPartrec.dom_re · cited by 1Partrec.dom_reComputablePred.halting_proble…CITED BYCITES

Cites9

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.