High-Road and Low-Road Programs

Authors

  • Donald Michie

DOI:

https://doi.org/10.1609/aimag.v3i1.364

Abstract

Consider a class of computing problem for which all sufficiently short programs are too slow and sufficiently fast programs are too large. Most non-standard problems of this kind were strictly alone for the first twenty-years or so of the computing era. There were two good reasons. First, the above definition rules out both the algorithmic and the database type of solution. Second, in a pinch, a human expert could usually be found who was able at least to compute acceptable approximations -- for transport scheduling, job-shop allocation, inventory optimization, or whatever large combinatorial domain might happen to be involved.

Downloads

Published

1982-03-15

How to Cite

Michie, D. (1982). High-Road and Low-Road Programs. AI Magazine, 3(1), 21. https://doi.org/10.1609/aimag.v3i1.364

Issue

Section

Workshop Reports