Friday, October 28, 2016

A cliffy review of computational determinism

For determinism defined as:


 σ = { 0,1,2,3,..., Ω } π ;
 τ = { 0,1,2,3,..., Χ } π .

A sequential process, σ(π), runs on a sequential machine in deterministic time, Ω, with respect to its operation as a unit.

A nondeterministic process runs on a sequential machine in the probability of completing, Χ.