Logic & Formal Reasoning
REALIZATION OF A GEOMETRY-THEOREM PROVING MACHINE H. Gelernter
In particular the technique of heuristic programming is under detailed investigation as a means to the end of applying largescale rently digital computers to the solution of a difficult class of problems cur considered to be beyond their capabilities; namely those problems that seem to require the agent of human intelligence and ingenuity for their solution. It is difficult to characterize such problems further, except, perhaps, plex to remark rather vaguely that they generally involve com vironment.
cowl '
Step 6 is a goal-assertion the input, another algorithm might result. Thus one could resolution that functions similarly to the goal-goal resolution break a into a[1],..., a [length(a)/2] and a [length(a)/ above. The final synthesized program is: 2 1],..., a[length(a)] and find an algorithm that recursively calls f on both the first and second halves of its f(x) if x NIL then 0 else car(x) f(cdr(x)).
AUTOMATA STUDIES
Printed in the United States of America PREFACE Among the most challenging scientific questions of our time are the corresponding analytic and synthetic problems: How does the brain function? Can we design a machine which will simulate a brain? Speculation on these problems, which can be traced back many centuries, usually reflects in any period the characteristics of machines then in use. Descartes, in DeBomine, sees the lower animals and, in many of his functions, man as automata. Using analogies drawn from water-clocks, fountains and mechanical devices common to the seventeenth century, he imagined that the nerves transmitted signals by tiny mechanical motions.