Abstract#R##N##R##N#This note describes a method of enabling non-deterministic algorithms to be written in conventional deterministic programming languages. The method involves a dynamic manipulation of stack contents, and is contrasted with standard techniques of implementing non-deterministic programming languages.
['John A. Self']
Embedding non‐determinism