recognition /
Complexity /
Complexity.SAT.Runtime /
explainer
No prose has been written for this declaration yet. The Lean source and graph data below render
without it.
generate prose now
formal statement (Lean)
27 def caTimeBound (M : CARuntimeModel) (n : ℕ) : Prop :=
proof body
Definition body.
28 ∃ c : ℝ, 0 < c ∧ (M.sideLength n : ℝ) * (logicalDepth n : ℝ) ≤ c * (n : ℝ)^(1/3 : ℝ) * Real.log (n + 2)
29
30 /-- CA→TM simulation cost: TM time = O(volume * steps).
31 The actual content would specify that a Turing Machine can simulate
32 a cellular automaton with volume V and time T in O(V·T) steps. -/
depends on (14)
Lean names referenced from this declaration's body.
CARuntimeModel
in IndisputableMonolith.Complexity.SAT.Runtime
decl_use
logicalDepth
in IndisputableMonolith.Complexity.SAT.Runtime
decl_use
V
in IndisputableMonolith.Cosmology.InflatonPotentialFromJCost
decl_use
T
in IndisputableMonolith.Foundation.Breath1024
decl_use
cost
in IndisputableMonolith.Foundation.MultiplicativeRecognizerL4
decl_use
cost
in IndisputableMonolith.Foundation.ObserverForcing
decl_use
V
in IndisputableMonolith.Foundation.SpectralEmergence
decl_use
T
in IndisputableMonolith.Gap45.SyncMinimization
decl_use
and
in IndisputableMonolith.NumberTheory.CirclePhaseLift
decl_use
that
in IndisputableMonolith.NumberTheory.PhiLadderLattice
decl_use
volume
in IndisputableMonolith.Papers.GCIC.BrainHolography
decl_use
M
in IndisputableMonolith.Recognition
decl_use
M
in IndisputableMonolith.Recognition.Cycle3
decl_use
V
in IndisputableMonolith.RRF.Core.Glossary
decl_use