Computation time (also called "running time") is the length of time required to perform a computational process. Representing a computation as a sequence of rule applications and assigning the same time cost to each application, the computation time is proportional to the number of rule applications. In a logic-gate version of a quantum computer, the computation time for a computation performed by sequential application of gates with the same time cost is proportional to the number of unitary transformations performed.
Computation Time
See also
Automata Theory, Blum's Speed-Up Theorem, Computation, Principle of Computational Equivalence, Random Access Machine, Turing MachineThis entry contributed by Todd Rowland
Explore with Wolfram|Alpha
Cite this as:
Weisstein, Eric W., with contributions by Todd Rowland. "Computation Time." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/ComputationTime.html