4 ms·
Trying to put on my Stephen Wolfram hat here and expect he would refer to this as an example of computational irreducibility.
by nicholast 6y ago
Trying to put on my Stephen Wolfram hat here and expect he would refer to this as an example of computational irreducibility.
- mpoteat 6y agoI mean, deciding whether or not an arbitrary starting configuration loops back on itself is undecidable. So some problems are out of the reach of a finite sized network.