Mathlib Map

Theorems · Definition · logic and foundations

TuringEquivalent

(ℕ →. ℕ) → (ℕ →. ℕ) → Prop

f is Turing equivalent to g if f is reducible to g and g is reducible to f.

Defined in
Mathlib.Computability.TuringDegree
Cited by
4 results in Mathlib
Foundations
Depth 21 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

TuringEquivalent.equivalence · cited by 3TuringEquivalent.equivale…TuringEquivalent.refl · cited by 0TuringEquivalent.reflTuringEquivalent.symm · cited by 0TuringEquivalent.symmTuringEquivalent.trans · cited by 0TuringEquivalent.transPFun · cited by 207PFunAntisymmRel · cited by 93AntisymmRelTuringReducible · cited by 6TuringReducibleTuringEquivalentCITED BYCITES

Cites3

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

Cited by4

Results whose statement or proof uses this declaration.