Demonic Non-determinism
A term which describes the execution of a non-deterministic program where all choices are made in favour of non-termination. References Theoretical computer science {{comp-sci-theory-stub ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  

Non-deterministic Program
A nondeterministic programming language is a language which can specify, at certain points in the program (called "choice points"), various alternatives for program flow. Unlike an if-then statement, the method of choice between these alternatives is not directly specified by the programmer; the program must decide at run time between the alternatives, via some general method applied to all choice points. A programmer specifies a limited number of alternatives, but the program must later choose between them. ("Choose" is, in fact, a typical name for the nondeterministic operator.) A hierarchy of choice points may be formed, with higher-level choices leading to branches that contain lower-level choices within them. One method of choice is embodied in backtracking systems (such as Amb, or unification in Prolog), in which some alternatives may "fail," causing the program to backtrack and try other alternatives. If all alternatives fail at a particular choice point, then an entire br ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]