Branch
Jump to navigation
Jump to search
| Branch |
 Title text: Of course the deep concern is that there's a way to elegantly prove the existence of an ugliest possible proof. |
Votey
Explanation
|
This explanation is either missing or incomplete. |
Transcript
|
This transcript was generated by a bot: The text was scraped using AWS's Textract, which may have errors. Complete transcripts describe what happens in each panel — here are some good examples to get you started (1) (2). |
- [Describe panel here]
- A new branch of mathematics.
- Our goal is to find the least elegant proofs. Those that take the most effort for the shallowest understanding
- Consider the game go, where the number of legal positions for an nxn board can be found in entry a094777 of the on-line encyclopedia of integer sequences
- By setting the formula for the sequence equal to bremermann's limit, we can derive that the entire game-tree of a 16x16 go board could be explored only by using all time and all matter to manually check every branch.
- Thus with a mere
- 256 squares, we can achieve perfect play, maximum effort, and an absolute
- Minimum of insight.
- This is the third branch of mathematics! It is too ugly to be pure and too useless to be applied!
- Seize him! Before he destroys everything!
- Ahahahahahaha!
- I can ruin all math with a single 6x6 chessboard!
- Gag him! Gag him!
Votey Transcript
|
|
This transcript was generated by a bot: The text was scraped using AWS's Textract, which may have errors. Complete transcripts describe what happens in each panel — here are some good examples to get you started (1) (2). |
- [Describe panel here]
- Homework: Find less elegant math. Least elegant gets 4 smbc points.
add a comment! ⋅ add a topic (use sparingly)! ⋅ 
refresh comments!
Discussion
No comments yet!