Thanks, the article piqued my interest and after hearing all this I might have to check it out.
Thanks, the article piqued my interest and after hearing all this I might have to check it out.
Same here. Another math-centric channel that’s super interesting is Numberphile. Binged a lot of those
Lower. It caught their attention because a science fiction author had come up with upper bound, which the article notes was also bizarre.
Houston had just learned that Australian science fiction author Greg Egan had found a new maximum length for the shortest superpermutations
Some interesting bits from the article:
Anon is credited as the first author in the paper
Computers are able to calculate superpermutations for n = 4 and n = 5 but not for anything beyond that.
Since the series in question has 14 episodes, it would take 93,884,313,611 episodes to see all possible combinations. Or roughly 4 million years of non-stop viewing.
Visit some of the National Parks, aka America’s best idea.
Some amazing ones (they’re all amazing, tbh) in no particular order: