Two most nondeterministic programs (Q1064048)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two most nondeterministic programs |
scientific article; zbMATH DE number 3919787
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two most nondeterministic programs |
scientific article; zbMATH DE number 3919787 |
Statements
Two most nondeterministic programs (English)
0 references
1986
0 references
The computations evoked by starting a program can differ with respect to termination and - in case of termination - final state. This paper contains two examples, together with formal proofs, of programs with different classes of possible computations for different initial states.
0 references
nondeterministic programs
0 references
final state
0 references
initial states
0 references