I complete the first 100 theorems from the set.mm proof database in 38min 42sec, ignoring the ones whose names end with OLD. This can definitely go sub-30, feel free to beat my time. The rules are:
1. No referring to notes during the speedrun. (or anything related to Metamath / proofs)
2. Use the original Metamath executable written in C.
3. Memorizing prior to speedrun is allowed.
4. Proofs can be done in any order, as long as the 100 theorems are the same as the ones I proved here.
5. Timer stops when Metamath verifies that all proofs were verified.
To learn more about metamath, visit http://us.metamath.org
The blank proof file I used for the speedrun can be found here: lbry://@jiaminglimjm#e/speedrun_100_theorems.mm#5
MIT OpenCourseWare 6.006 Introduction to Algorithms, Fall 2011
View the complete course: http://ocw.mit.edu/6-006F11
Instructors: Srini Devadas & Erik Demaine
Course material can be downloaded here:
lbry://MITOCW6-006F11-Course-Material
Download the video to watch with subtitles. Available in English, Chinese and Arabic.
Blank metamath file for speedrunning. These are the first 100 theorems from set.mm, ignoring the ones that end with OLD.
set.mm can be found here: https://github.com/metamath/set.mm
MIT OpenCourseWare 6.006 Introduction to Algorithms, Fall 2011
View the complete course: http://ocw.mit.edu/6-006F11
Instructors: Srini Devadas & Erik Demaine
Course material can be downloaded here:
lbry://MITOCW6-006F11-Course-Material
Download the video to watch with subtitles. Available in English and chinese.
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International
MIT OpenCourseWare 6.006 Introduction to Algorithms, Fall 2011
View the complete course: http://ocw.mit.edu/6-006F11
Instructor: Srini Devadas & Erik Demaine
This file includes all the material from the link above except the lecture and recitation videos. Watch the lectures from the links below:
Lecture 1: Algorithmic Thinking, Peak Finding
lbry://MITOCW6-006F11-lec01
Lecture 2: Models of Computation, Document Distance
<-- URL to be added -->
Lecture 3: Insertion Sort, Merge Sort
<-- URL to be added -->
Lecture 4: Heaps and Heap Sort
<-- URL to be added -->
Lecture 5: Binary Search Trees, BST Sort
<-- URL to be added -->
Lecture 6: AVL Trees, AVL Sort
<-- URL to be added -->
Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting
<-- URL to be added -->
Lecture 8: Hashing with Chaining
<-- URL to be added -->
Lecture 9: Table Doubling, Karp-Rabin
<-- URL to be added -->
Lecture 10: Open Addressing, Cryptographic Hashing
<-- URL to be added -->
Lecture 11: Integer Arithmetic, Karatsuba Multiplication
<-- URL to be added -->
Lecture 12: Square Roots, Newton's Method
<-- URL to be added -->
Lecture 13: Breadth-First Search (BFS)
<-- URL to be added -->
Lecture 14: Depth-First Search (DFS), Topological Sort
<-- URL to be added -->
Lecture 15: Single-Source Shortest Paths Problem
<-- URL to be added -->
Lecture 16: Dijkstra
<-- URL to be added -->
Lecture 17: Bellman-Ford
<-- URL to be added -->
Lecture 18: Speeding up Dijkstra
<-- URL to be added -->
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths
<-- URL to be added -->
Lecture 20: Dynamic Programming II: Text Justification, Blackjack
<-- URL to be added -->
Lecture 21: Dynamic Programming III: Parenthesization, Edit Distance, Knapsack
<-- URL to be added -->
Lecture 22: Dynamic Programming IV: Guitar Fingering, Tetris, Super Mario Bros
<-- URL to be added -->
Lecture 23: Computational Complexity
<-- URL to be added -->
Lecture 24: Topics in Algorithms Research
<-- URL to be added -->
MIT OpenCourseWare 6.006 Introduction to Algorithms, Fall 2011\n\nView the complete course: http://ocw.mit.edu/6-006F11\n\nInstructors: Srini Devadas & Erik Demaine\n\nCourse material can be downloaded here:\nlbry://MITOCW6-006F11-Course-Material\n\nDownload the video to watch with subtitles. Available in English.