pith. machine review for the scientific record. sign in
theorem proved term proof

computation_takes_time

show as:
view Lean formalization →

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)

 128theorem computation_takes_time (n : ℕ) (hn : n > 0) :
 129    n * fundamental_tick > 0 := by

proof body

Term-mode proof.

 130  exact mul_pos (Nat.cast_pos.mpr hn) tick_pos
 131
 132/-! ## V. The Physical Church-Turing Bridge -/
 133
 134/-- **THEOREM IC-003.10**: Every finite function on a finite type is "computable"
 135    in the sense that it can be represented by a lookup table. -/

used by (1)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (12)

Lean names referenced from this declaration's body.