I’m splitting hairs here, but wouldn’t the 10^96 number just need to be a bound on the Kolmogorov complexity, whose value would be uncomputable? I don’t think you can conclude solution storage is impossible, it’s possible the Kolmogorov complexity is astonishingly low and there’s an algorithm that could be stored on a drive today, it would just require brilliant insight to find it and no one is going to devote time to that for a variety of reasons.
=> More informations about this toot | View the thread | More toots from christian@lemmy.ml
=> View zeezee@slrpnk.net profile
text/geminiThis content has been proxied by September (3851b).