Interpretation of Probabilistic Algorithmic Logic in Nondeterministic Algorithmic Logic

In this paper probabilistic and nondeterministic programs are considered on the ground of logic of programs. The formal semantics of probabilistic and nondeterministic computations of a program are the starting point for the comparing properties of these programs. We are interested in dependencies, especially in similarities between nondeterministic and probabilistic interpretation of a program.