Search as a Basic Technique
Search should be regarded as a basic technique of Computer Science,
useful for many areas where no nice algorithm exists.
Example:
William Wulf used search to automatically
generate code generators
for new CPUs for an Ada compiler.
- Goal: an instruction sequence that
accomplishes what the generated code is
supposed to do (e.g., add A to B and
put the result in C).
- Operators: Instructions of the target CPU.
Search was used to find a minimum-cost sequence of machine instructions
that would accomplish the desired task.
Contents
Page-10
Prev
Next
Page+10
Index