demonic non-determinism

A term which describes the execution of a non-deterministic program where all choices are made in favour of non-termination.{{Cn|date=August 2014}}

References

{{cite book |last1=Wirsing |first1=M. |last2=Broy |first2=M. |chapter=On the algebraic specification of nondeterministic programming languages |title=Caap '81 |volume=112 |date=5 March 1981 |pages=162–179 |doi=10.1007/3-540-10828-9_61 |publisher=Springer, Berlin, Heidelberg |language=en|series=Lecture Notes in Computer Science |isbn=978-3-540-10828-3 }}

{{cite journal |last1=McIver |first1=A. K. |author1-link= Annabelle McIver |last2=Morgan |first2=Carroll |title=Partial correctness for probabilistic demonic programs |journal=Theoretical Computer Science |date=6 September 2001 |volume=266 |issue=1 |pages=513–541 |doi=10.1016/S0304-3975(00)00208-5 |issn=0304-3975|url=https://ora.ox.ac.uk/objects/uuid:3e2e96ad-46ac-441b-bf99-c82354aadb10 |doi-access=free }}

Category:Theoretical computer science