>[!abstract] >Steven Wolfram's idea that an algorithm is computationally irreducible when no procedure is faster than running through each step of the algorithm. To "jump ahead", the procedure would have to be somehow more sophisticated than the system it is looking to predict. >[!example] Additional references >- [[Wolfram, 2002]] >[!related] >- **North** (upstream): — >- **West** (similar): — >- **East** (different): — >- **South** (downstream): —