Goto

Collaborating Authors

 Technology


Realization of a geometry theorem-proving machine

Classics

... the technique of heuristic programmingis under detailed investigation as a means to the end of applying largescaledigital computers to the solution of a difficult class of problems currentlyconsidered to be beyond their capabilities; namely those problemsthat seem to require the agent of human intelligence and ingenuity fortheir solution. It is difficult to characterize such problems further, except,perhaps, to remark rather vaguely that they generally involve complexdecision processes in a potentially infinite and uncontrollable environment.If, however, we should restrict the universe of problems to those thatamount to the discovery of a proof for a theorem in some well-definedformal system, then the distinguishing characteristics of those problems ofspecial interest to us are brought clearly into focus.Proceedings of an International Conference on Information Processing. Paris:UNESCO House, 273-282.







Mechanisation of Thought Processes vol. 1 & 2

Classics

TABLE OF CONTENTS FOR the two volumes of papers and discussions of papers from the 1959 conference held at the National Physical Laboratory, sometimes known as "The Teddington Conference". Officially these two volumes are the Proceedings of the Symposium on Mechanisation of Thought Processes. Many of the classics are downloadable separately, the remainder are available from the longer downloads of the complete volumes:Vol 1 = http://aitopics.org/sites/default/files/classic/TeddingtonConference/Mechanisation of Thought Processes Vol. 1.pdfVol. 2 = http://aitopics.org/sites/default/files/classic/TeddingtonConference/Mechanisation of Thought Processes Vol. 2.pdfTeddington Conference




Machine learning

Classics

From: Technology Review, November, 62:42-45. See also: Some studies in machine learning using the game of checkers, IBM Journal of Research and Development, 3(3) :210-229, 1959.