HackerTube 中文?

Lec 1 | MIT 6.042J Mathematics for Computer Science, Fall 2010

MIT OpenCourseWareYouTube ↗

Further reading 1

When does a pattern in a picture become a proof? →A tiling suggests a conjecture, a new encoding turns rectangles into collisions, and a plotting rule creates spirals before primes even enter the picture. What work does each picture actually do?This video helps answer · First try cases that might fail

Caption notes

A counterexample can defeat a universal statement. Repeated successes do not cover every input; a mathematical proof connects the proposition to axioms through deductions.

Video or transcript source ↗
Original passages · 2
AUDIENCE: Find counterexamples. PROFESSOR: Find counterexamples, yeah, that's good.
Lec 1 | MIT 6.042J Mathematics for Computer Science, Fall 2010 · ▶ 3:08–3:13
is a verification of a proposition by a chain of logical deductions from a set of axioms.
Lec 1 | MIT 6.042J Mathematics for Computer Science, Fall 2010 · ▶ 7:39–8:16

Hacker News comments

View original on HN ↗