I don’t think such a bound in itself is interesting, unless the proof reveals some strategy to prove more. There are infinitely potential bounds to BB(n), why is this particular case BB(10) > G useful for understanding fast growing functions?
First, an upper bound would be more useful to understand BB. But second, out of all large numbers, does this one give any information? We’ll have to see. The fact in itself is useless.
They mean a different statement, a different theorem. You have to understand that translating a theorem written in English text to lean code is also a non trivial step.
There are a few different types of Markdown apps. Many of them work like Notational Velocity/nvAlt/Obsidian where it's a folder of plain text files, you type in Markdown primarily, and the editor just applies some formatting after the fact, akin to syntax highlighting. IMO its much nicer than looking at just the Markdown, but it also has the advantage of remaining 100% portable text.
reply