The DOI matches its Crossref record.
Computation: Finite and Infinite Machines.
Abstract
From the Preface (See Front Matter for full Preface) Man has within a single generation found himself sharing the world with a strange new species: the computers and computer-like machines. Neither history, nor philosophy, nor common sense will tell us how these machines will affect us, for they do not do work as did machines of the Industrial Revolution. Instead of dealing with materials or energy, we are told that they handle control and information and even intellectual processes. There are very few individuals today who doubt that the computer and its relatives are developing rapidly in capability and complexity, and that these machines are destined to play important (though not as yet fully understood) roles in society's future. Though only some of us deal directly with computers, all of us are falling under the shadow of their ever-growing sphere of influence, and thus we all need to understand their capabilities and their limitations. It would indeed be reassuring to have a book that categorically and systematically described what all these machines can do and what they cannot do, giving sound theoretical or practical grounds for each judgment. However, although some books have purported to do this, it cannot be done for the following reasons: a) Computer-like devices are utterly unlike anything which science has ever considered---we still lack the tools necessary to fully analyze, synthesize, or even think about them; and b) The methods discovered so far are effective in certain areas, but are developing much too rapidly to allow a useful interpretation and interpolation of results. The abstract theory---as described in this book---tells us in no uncertain terms that the machines' potential range is enormous, and that its theoretical limitations are of the subtlest and most elusive sort. There is no reason to suppose machines have any limitations not shared by man.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Universality and complexity in cellular automata
Wolfram, S. (1984) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(84)90245-8 · Cited by 1,914
A lattice model of secure information flow
Denning, D. E. (1976) · Communications of the ACM · doi:10.1145/360051.360056 · Cited by 1,907
Swarm robotics: a review from the swarm engineering perspective
Brambilla, M., Ferrante, E., Birattari, M., & Dorigo, M. (2013) · Swarm Intelligence · doi:10.1007/s11721-012-0075-2 · Cited by 1,762
Newell, A. (1980) · Cognitive Science · doi:10.1207/s15516709cog0402_2 · Cited by 1,458
Steane, A. (1998) · Reports on Progress in Physics · doi:10.1088/0034-4885/61/2/002 · Cited by 1,391
Metadata
- Authors
- Clarke, D. A., & Minsky, M. L.
- Venue
- The American Mathematical Monthly
- Publisher
- JSTOR
- Published
- 1968-04
- Volume
- 75
- Issue
- 4
- Pages
- 428
- ISSN
- 0002-9890 (ISSN-L)
- OpenAlex
- W2012140001
- Cited by
- 2,583
- References
- 0
- FWCI
- 20.05
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computation: Finite and Infinite Machines. https://app.cochat.ai/papers/10.2307/2313471
- The paper
- Clarke, D. A., & Minsky, M. L. (1968). Computation: Finite and Infinite Machines. The American Mathematical Monthly. https://doi.org/10.2307/2313471
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.