TOPICS
Search

Deterministic


A Turing machine is called deterministic if there is always at most one instruction associated with a given present internal state/tape state pair (q,s). Otherwise, it is called nondeterministic (Itô 1987, p. 137).

In prediction theory, let {X_t} be a weakly stationary process, and let M_t(X) be a subspace spanned by the X_s (with s<=t). If M_t(X) is independent of t so that M_t(X)=M(X) for every t, then {X_t} is said to be deterministic (Itô 1987, p. 1463).


See also

Prediction Theory, Random, Stochastic, Turing Machine

Explore with Wolfram|Alpha

References

Itô, K. (Ed.). "Turing Machines." §31B in Encyclopedic Dictionary of Mathematics, 2nd ed., Vol. 1. Cambridge, MA: MIT Press, pp. 136-137, 1987.Itô, K. (Ed.). §395D in Encyclopedic Dictionary of Mathematics, 2nd ed., Vol. 3. Cambridge, MA: MIT Press, p. 1463, 1987.

Referenced on Wolfram|Alpha

Deterministic

Cite this as:

Weisstein, Eric W. "Deterministic." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/Deterministic.html

Subject classifications