Demonic non-determinism
From HandWiki
In computer science, demonic non-determinism is a term which describes the execution of a non-deterministic program where all choices are made in favour of non-termination.[citation needed]
References
- Broy, M.; Wirsing, M. (1981). "On the algebraic specification of nondeterministic programming languages". in Astesiano, E.; Böhm, C.. Caap '81. Lecture Notes in Computer Science. 112. Berlin, Heidelberg: Springer. pp. 162–179. doi:10.1007/3-540-10828-9_61. ISBN 978-3-540-10828-3.
- McIver, A. K.; Morgan, Carroll (2001). "Partial correctness for probabilistic demonic programs". Theoretical Computer Science 266 (1): 513–541. doi:10.1016/S0304-3975(00)00208-5. https://ora.ox.ac.uk/objects/uuid:3e2e96ad-46ac-441b-bf99-c82354aadb10.
 |  |
