BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-72-253
       ENTRY:: October 16, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Total complexity and the inference of best programs.
        TYPE:: Technical Report
      AUTHOR:: Feldman, Jerome A.
      AUTHOR:: Shields, Paul C.
        DATE:: April 1972
       PAGES:: 22
    ABSTRACT:: Axioms for a total complexity measure for abstract programs
               are presented. Essentially, they require that total
               complexity be an unbounded increasing function of the Blum
               time and size measures. Algorithms for finding the best
               program on a finite domain are presented, and their limiting
               behaviour for infinite domains described. For total
               complexity, there are important senses in which a machine
               $underline{can}$ find the best program for a large class of
               functions.
       NOTES:: [Adminitrivia V1/Prg/19951016]
         END:: STAN//CS-TR-72-253