67structure TuringModel where 68 /-- Turing time complexity -/ 69 T : ℕ → ℕ 70 /-- Recognition complexity is zero in the Turing model. -/ 71 recognition_complexity : ℕ → ℕ 72 recognition_free : ∀ n, recognition_complexity n = 0 73 74/-- Ledger-based computational model with explicit observation cost -/ 75
used by (2)
From the project-wide theorem graph. These declarations reference this one in their body.