You could be referring to either paragraph; am I guessing correctly it’s the first?
https://en.wikipedia.org/wiki/Quantum_Turing_machine links [Deutsch 1985], where Ctrl-F for ‘2.11’ describes a state transition from an encoding of a function and its argument to the same plus the result. A superposition of different functions/arguments would of course lead to a superposition of that plus results. Therefore, we can run different computations in different timelines.
Maybe? I don’t remember it working like that. Do you have a reference to something suggesting we can adopt this interpretation?
You could be referring to either paragraph; am I guessing correctly it’s the first?
https://en.wikipedia.org/wiki/Quantum_Turing_machine links [Deutsch 1985], where Ctrl-F for ‘2.11’ describes a state transition from an encoding of a function and its argument to the same plus the result. A superposition of different functions/arguments would of course lead to a superposition of that plus results. Therefore, we can run different computations in different timelines.