computational irreducibility
-
Is Wolfram’s Computational Irreducibility Too Strong?

Stephen Wolfram introduced the idea of Computational Irreducibility, which says that some systems are so complex, there’s no shortcut to predict what they’ll do–you have to go step by step, like running a full simulation. He suggests that in these cases, there’s no way to simplify the process. I love this idea, but if we Continue reading
