~/talk

Why Is A Math Proof Like A Unit Test?

Talkat GoGaRuCo 2012 · 2012-09-14..09-15· [testing, computer-vision]
links:none on file
slides:none on file

Claims that mathematical proof and unit tests are equivalent get sharpened: a clear induction proof shows sum 1..n = n(n+1)/2, but a spec written in Ruby/RSpec using recursion and rake cannot instantiate an arbitrary integer, so the test suite only exercises cases, not the axiom-based infinity that induction needs. Practical takeaway: TDD and heuristics guide development and decompose problems, but they cannot substitute for proofs; the induction vs unit tests contrast and the integer.new impossibility demonstrate the gap.

AI-written summary · about

  1. 0:00Introduction
  2. 0:49Title
  3. 1:18About Daniela
  4. 4:32About Recursion
  5. 6:16About Induction
  6. 7:42Sigma Notation
  7. 8:25What Are We Trying To Prove
  8. 13:43No Method Error
  9. 15:58Induction
  10. 17:12Everything is an object
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.