http://www.smbc-comics.com/comic/branch
Alt text
Of course the deep concern is that there’s a way to elegantly prove the existence of an ugliest possible proof.
Bonus panel
http://www.smbc-comics.com/comic/branch
Of course the deep concern is that there’s a way to elegantly prove the existence of an ugliest possible proof.
Oh huh, that’s still kinda neat imo.
Bremermann’s limit is actually really cool, it’s a theoretical maximum computation rate per kilogram. Basically the upper limit for a computer you could build that weighs 1 kg.
If the entire galaxy where a computer running at that speed, it would take beyond the heat death of the universe to crack 512 bit encryption by brute forcing the key.