Cameron Freer vdash- A Formal Math Commons
Loading...
Loading...
2,042
Link to this comment:
Share to:
Loading...
- 12:17Strata Santa Clara Preview - Bitsy Bentley on C...by OreillyMedia55 views
- 17:15Strata Santa Clara Preview - Noah Iliinsky on D...by OreillyMedia49 views
- 20:08Strata Santa Clara Preview - Paul Dix on Flurryby OreillyMedia31 views
- 16:20Strata Santa Clara Preview - Alistair Croll and...by OreillyMedia32 views
- 5:11High Troughput Humanitiesby MaximilianSchich640 views
- 2:02PhD Pure Mathematicsby mapsleeds658 views
- 5:00Ignite Sebastopol - Tim O'Reillyby EmpireReport518 views
- 2:57Math Prodigy Terence Tao, UCLAby UCLA372,941 views
- 7:12(2:2) Where the Laplace Transform comes from (A...by hamsterpoop28,329 views
- 2:28Pure Mathematicsby SMCSixthForm402 views
- 5:00Michael Slater - O'Reilly Ignite Sebastopolby EmpireReport220 views
- 3:42first try Pythagorean Theorem SAT MATH NLCby mathproblems23,004 views
- 1:45GeeksOnaPlane: Ignite Amsterdam (Brady Forrest,...by GeeksOnAPlane178 views
- 0:30Google Project 10^100 - [no citation needed]by freervdash160 views
- 12:23Proof by induction FP1 further pure mathematicsby maths2473,114 views
- 6:12LANGUAGE IS A MAP by Tim O'Reilly, EP 38by iGNiTe6,865 views
- 1:19O'Reilly Ignite .. Skiing Outside the Tracksby rhoeg78 views
- 6:27Ignite: Molly Wright Steenson - A Series of Tub...by iGNiTe27,907 views
- 0:35Tim O'Reilly talks about Ignite UK Northby OReillyGMT84 views
- 39:49Lec 1 | MIT 18.06 Linear Algebra, Spring 2005by MIT647,445 views
my name is cameron freer also
cam12freer 2 years ago
In the beginning everyone thought Wikipedia is not possible. Wiki might prove a good way to do this kind of stuff (building mathematics that can be checked by the computer).
TakuyaMurata 3 years ago
Why microsft? That's so uncool
TakuyaMurata 3 years ago
It has become quite clear by now that writing a
computer verifiable proof of some non-trivial statement
is actually quite hard. I assume that in finite combinatorics
or similar fields verifiable proof are actually doable, but
what if the notion that the theorem talks about are more complex? How difficult is it practically to write a computer
verifiable proof of something interesting like Ramsey's
theorem or some classics in analysis like the Heine-Borel
theorem?
c330user 3 years ago