Includes a brief history of Babbage's work (pp. 1-3).
This is the paper in which Simon and Newell predicted
that (among other things) a computer would "be the world's
chess champion" (p.7) within 10 years, i.e., by 1968. I
once asked Simon about this; our email conversation can
be found
here.
Interesting historical comments by the developer of the
resolution method of automated theorem proving on the development of
computers and the related history of logic.
A description of how computers work, written, for radio
engineers who may never have seen one(!), by the creator of one of the
earliest, if not the first, AI programs: Samuel's checkers player.
Comes close to defining a computer "as an information or
data processing device which accepts data in one form and delivers it in
an altered form" (p.1223).
§§1-4 are a good summary of issues
related to the nature of computationalism,
observer-dependence (as opposed to what Searle
calls "intrinsic" computationalism), and universal
realizability (or "pancomputationalism").
§1, "The Problem of Physical Computation:
What Does Distinguish Computers from Other Physical Systems?",
contains a good survey of various theories of what a computer
is.
"Indeed, computational algorithms are so powerful that they can
simulate virtually any phenomena, without proving anything about the
computational nature of the actual mechanisms underlying these
phenomena. Computational algorithms generate a perfect description of
the rotation of the planets around the sun, although the solar system
does not compute in any way. In order to be considered as providing a
model of the mechanisms actually involved, and not only a simulation of
the end-product of mechanisms acting at a different level, computational
models have to perform better than alternative, non computational
explanations."
From §1.3.4 of
Perruchet, Pierre; & Vinter, Annie
(2002),
"The Self-Organizing Consciousness",
Behavioral and Brain Sciences
25(3) (June): 297-388.