REALIZATION OF A GEOMETRY-THEOREM PROVING MACHINE H. Gelernter

AI Classics/files/AI/classics/Feigenbaum_Feldman/Computers_And_Thought-Part_1_Geometry.pdf 

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.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found