3 ms·
If at least one cellular automata configuration is Turing complete and a Turing machine can simulate a quantum computer, then cellular automata can simulate a q
by heavenlyblue 6y ago
If at least one cellular automata configuration is Turing complete and a Turing machine can simulate a quantum computer, then cellular automata can simulate a quantum computer.
I like his diagrams, they look cute.
- undersuit 6y agoWell that's why I really like this. There are Turing complete configurations in cellular automata like GoL, but they are fiendishly complex, nothing approaching the simplicity of the simplest complete Turing Machine. A Multiway Turing Machine could get you the simplest possible complete Quantum Turing Machine(irreducible?) in a way where you aren't wasting states on GoL gliders to ferry information across your imaginary cpu.