Task reduction systems : (preprint)
H.J. Boom · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · 1978
The essential computational dependencies in a problem to be progranuned can be expressed as a "task replacement system" which indicates how tasks can be accomplished if other tasks are first accomplished.Associating a well-ordering with a suitable task replacement system can provide a constructive proof that an algorithm exists for solving a problem, without actually requiring the effort of writing a program.The method is demonstrated on very small examples.