From Wikipedia, the free encyclopedia
A term which describes the execution of a non-deterministic program where all choices are made in favour of non-termination.[citation needed]
Wirsing, M.; Broy, M. (5 March 1981). "On the algebraic specification of nondeterministic programming languages". Caap '81. Lecture Notes in Computer Science. Vol. 112. Springer, Berlin, Heidelberg. pp. 162–179. doi:10.1007/3-540-10828-9_61. ISBN 978-3-540-10828-3.
McIver, A. K.; Morgan, Carroll (6 September 2001). "Partial correctness for probabilistic demonic programs". Theoretical Computer Science. 266 (1): 513–541. doi:10.1016/S0304-3975(00)00208-5. ISSN 0304-3975.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4