This talk reviews those efforts in automatic theorem proving, during the past few years, which have theory, very easy for the computer.

In this paper we present a new algorithm for searching trees. The algorithm, which we have named For this reason, the search is usually limited in some way (e.g., number of nodes B*, finds a proof that an arc at the root of a search tree is better than any other. It does this by to be expanded, or maximum depth to which it may go).

Human programmers seem to know a lot about programming. This suggests a way to try to build here was designed to shed some light on questions like these.

R. L. GREGORY, Psychological Laboratory, Cambridge Discussion on paper 5 683 6 Some questions concerning the explanation of learning 691 in animals MR. A. J. WATS01,4 Psychological Laboratory, Cambridge Discussion on paper 6 721 7 Information, redundancy and decay of the memory trace 729 DR. Y. BAR-HILLEL, The Hebrew University, Jerusalem Discussion on paper 2 801 3 To what extent can administration be mechanized?

APPENDIX I Attendance List *An asterisk indicates either that the person was a part--time deputy for a delegate, or that their attendance was restricted to particular Sessions by accomodation difficulties.

There will, of course, be many problems to be solved before these tasks can be regarded as satisfactorily completed, and before we can speak with confidence out of experience. But these problems do not appear to have any fundamentally insuperable content. The difficul-- ties are manmade rather than intrinsic. They originate in part from the difficulty of adjusting the organisms of office life to new rhythms, new environments, new relationships, in part from imperfect understanding and appreciation of the power and range of new techniques, and in part from a lack of perception of the limitations and deficiencies of these systems. We may reasonably suppose that, during the course of the next five years, these difficulties will be overcome and that, throughout Government Departments and Industry, there will be a growing number of installations at work on these jobs. With this perhaps over--simplified premise, it is not too early to start thinking about a possible future form of A.D.P. in Government Departments in, say, ten or fifteen years' time.

I am quite ready to subscribe to the already mentioned slogan that "whatever a human being can do,an appropriate machine can do, too"; but I do this only because.I regard the slogan as utterly trivial. At the moment, I am not talking about what maohines could do in principle but only about what actually existing or blueprinted machines could do, and it Is with regard to these that I utter my definite opinions. If someone wishes to write sciencefiction about information-processing centres of the (undetermined) future, let him do so and I shall discuss it with him over a glass of beer and even offer some startling suggestions of my own. If he is interested in improving the literature search process today, I would strongly advise him to forget about mechanizing abstracting or indexing. May I add that it is with a good amount of sorrow that I have come to this conclusion which is quite counter, to my temperament and my convictions (never published) of a few years ago.

Dr. Lucien Mehl, born 1919 in Paris, studied at the University, Paris where he obtained his degrees in Philosophy and Law, and a Diploma of Advanced Studies in Political Economy and at the National School of Administration. He is now'Maitre des Requetesi to the Council of State and Director of external training at the National School of Administration. He is a member of the International Fiscal Association, the International Cybernetics Association and the French Operational Research Society. He has published a number of articles on administrative science, law, cybernetics and operational research. INTRODUCTION I. It may seem an ambitious step to try to apply mechanization or automation to the legal sciences. However, a machine for processing information can be an effective aid in searching for sources of legal information, in developing legal argument, in preparing the decision of the administrator or judge, and finally in checking the coherence of solutions arrived at.

Dr. Francois Paycha, born at Narbonne, studied medicine at the University of Montpellier. His first researches were concerned with the embryology of the eye, later using the distribution of radioactive phosphorus P32 to study the structure of the tissues and for the detection of tumours. He was then appointed to the National Centre of Scientific Research. While in charge of a hospital clinic, he noted the considerable differences in the diagnoses of conscientious and knowledgeable practitioners and those advanced by the hospital. In view of the special need for exact diagnosis in medicine he made a study of the causes of these differences. After theoretical research, he made the first "Medical Memory' in 1953 with the help of Bull and later of I.B.M. He studied the structure of a three-symbol logic which is applicable to medical' problems and in general. After a year in the service of Prof. G. E. Jayle, he abandoned pure research and entered industry. SUMMARY I am going to analyse ...

His psychiatric training was at Rockland State Hospital (N.Y.), 1932-4. Until 1941 he held several fellowships at Yale University, Laboratory of Neurophysiology, on activity of the central nervous system, becoming Assistant Professor 1940-1. From 1941 to 1952 he was Professor of Psychiatry and Physiology and Neurophysiologist at the University of Illinois. Since 1952 he has been staff member of the Research Laboratory of Electronics at Massachusetts Institute of Technology. He is the author of numerous articles on functional organization of the brain, and on facilitation, extinction and functional organisation of the cerebral cortex. SUMMARY VENN diagrams, with a jot in every space for all cases in which given logical functions are true, picture their truth tables. These symbols serve as arguments in similar expressions that use similar symbols for functions of functions. When jots appear fortuitously with given probabilities or frequencies, the Venn diagram can be written with l's for fixed jots, O's for fixed absence, and p's for fortuitous jots. Any function is realizable by many synaptic diagrams of formal neurons of specified threshold, and the fortuitous jots of their symbols can be made to signify a perturbation of threshold in an appropriate synaptic diagram. Nets of these neurons with common inputs embody hierarchies of functions, each of which can be reduced to input-output functions pictured in their truth tables.