Evaluation of the computation of wave direction with three-gage arrays /

Issued July 1977.

Computation by the method of characteristics of disturbance in an elastic half-space caused by blast-like surface loading

Mode of access: Internet.

Hierarchical associative memories for parallel computation /

"This report reproduces a thesis of the same title submitted to the Department of Electrical Engineering, Massachusetts Institute of Technology, in partial fulfillment of the requirements for the degree of Doctor of Philosophy, May 1970."--p. 2

Stresses in simple framed structures : a text book to accompany exercises in the computation of the axial stresses in the members of load-bearing frames /

"List of treatises on stresses": p. 190.

Computation of drawdowns at equilibrium caused by wells drawing water from an aquifer fed by a finite straight line source /

Mode of access: Internet.

Hypothetical flood computation for a stream system /

Mode of access: Internet.

Development of procedures for rapid computation of dynamic structural response /

Mode of access: Internet.

Computation of rapidly varied unsteady, free-surface flow /

Shipping list no.: 87-677-P.

An elementary essay on the computation of logarithms : containing a view of the most expeditious methods of constructing a table of those numbers /

Mode of access: Internet.

Radiosonde observation computation tables.

Mode of access: Internet.

Punched card methods in scientific computation,

Mode of access: Internet.

Computation in Non-Classical Foundations?

The Church-Turing Thesis is widely regarded as true, because of evidence that there is only one genuine notion of computation. By contrast, there are nowadays many different formal logics, and different corresponding foundational frameworks. Which ones can deliver a theory of computability? This question sets up a difficult challenge: the meanings of basic mathematical terms (like "set", "function", and "number") are not stable across frameworks. While it is easy to compare what different frameworks say, it is not so easy to compare what they mean. We argue for some minimal conditions that must be met if two frameworks are to be compared; if frameworks are radical enough, comparison becomes hopeless. Our aim is to clarify the dialectical situation in this bourgeoning area of research, shedding light on the nature of non-classical logic and the notion of computation alike.