2 ms·
You don't need neurons for Turing completeness. Very simple cellular automata can compute any computable function. In fact, even in a 1D universe of cells Turin
by adrianN 10y ago
You don't need neurons for Turing completeness. Very simple cellular automata can compute any computable function. In fact, even in a 1D universe of cells Turing complete computation is possible:
https://en.wikipedia.org/wiki/Rule_110 https://en.wikipedia.org/wiki/Rule_110
- reitanqild 10y agoOk, you get points for that, TIL :-) Still struggle with the idea of feeding said thing properly in 2d.
- monocasa 10y agoLike he said, vacuoles.
- goldenkey 10y agoTheres a difference between "visible space" and memory space. A turing complete 1-d simulation can have a physical space that is 3 dimensional. If you wanted to see it, as the oracle, you would need to run a function on the space. Think interpretation..not 1 for 1