Angelic non-determinism
Jump to navigation
Jump to search
 | This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (November 2024) |
 | This article needs additional or more specific categories. (November 2024) |
In computer science, angelic non-determinism is the execution of a nondeterministic algorithm where particular choices are declared to always favor a desired result, if that result is possible.
For example, in halting analysis of a Nondeterministic Turing machine, the choices would always favor termination of the program.
The "angelic" terminology comes from the Christian religious conventions of angels being benevolent and acting on behalf of an omniscient God.
References
[edit | edit source]- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).