When you lose a game of chess to a computer then don't pretend that you didn't think at the game.

This paper describes some work on automatically generating finite counterexamples in topology, and the use of counterexamples to speed up proof discovery in intermediate analysis, and gives some examples theorems where human provers are aided in proof discovery by the use of examples.

This paper describes an evaluation and several applications of a knowledge-based system, the PROSPECTOR consultant for mineral exploration. PROSPECTOR is a rule-based judgmental reasoning system that evaluates the mineral potential of a site or region with respect to inference network models of specific classes of ore deposits. Knowledge about a particular type of ore deposit is encoded in a computational model representing observable geological features and the relative significance thereof.

A programming language based on sets; motivation and examples.

K.A.PATON 411 24 Centromere finding: some shape descriptors for small chromosome outlines.

MARK I DEVICE A minimal:robot,Icnown as Freddy, has been constructed with the aim of connecting a usable device on-line to the Department's lc L 4130, under the Multi-Pop time-sharing system, and discovering the snags. (See figure 1). Freddy Mark 1 and his world Various technical problems arise when such a device runs free. It is much easier to anchor it and allow it to push its world about. Our present world is a three-foot diameter sandwich of hardboard and polystyrene which is light and rigid. Provided that the weights of robot and slab are chosen correctly, a wide range of movements is possible.

In particular its task domain is the analysis of mass spectra, chemical data gathered routinely from a relatively new analytical instrument, the mass spectrometer. This collaboration of chemists and computer scientists has produced what appears to be an interesting program from the viewpoint of artificial intelligence and a useful tool from the viewpoint of chemistry. For this discussion it is sufficient to say that a mass spectrometer is an instrument into which is put a minute sample of some chemical compound and out of which comes data usually represented as a bar graph. This is what is referred to here as the mass spectrum. The x-points of the bar graph represent the masses of ions produced and the y-points represent the relative abundances of ions of these masses. The first, preliminary inference (or planning), obtains clues from the data as to which classes of chemical compounds are suggested or forbidden by the data.

The equivalence problem for program schemes, or for programs, is reduced to the proving of a theorem in second-order logic. This work extends Manna's first-order logic reductions. Some examples of the technique are given together with a suggested method for obtaining proofs in special cases by firstorder methods. INTRODUCTION Several workers in recent years have considered using techniques and ideas of various mathematical theories of computation for proving interesting results about computer programs. This paper is concerned with two of these approaches.

The program contains a rough theory of mass spectrometry which is still in its formative stages.

Georgeff's controlled production systems 65 8.3.3