Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.

Computability: An introduction to recursive function theory

Cutland, Nigel · 1980 · Cambridge University Press eBooks

Abstract

What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr Cutland begins with a mathematical characterisation of computable functions using a simple idealised computer (a register machine); after some comparison with other characterisations, he develops the mathematical theory, including a full discussion of non-computability and undecidability, and the theory of recursive and recursively enumerable sets. The later chapters provide an introduction to more advanced topics such as Gildel's incompleteness theorem, degrees of unsolvability, the Recursion theorems and the theory of complexity of computation. Computability is thus a branch of mathematics which is of relevance also to computer scientists and philosophers. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest.

Overview

Integrity signals

Registry

Crossref · 10.1017/cbo9781139171496

Cites

34 of 34 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 34 references

Research works printed but not linked: 14

  1. Markov, 1954, The Theory of Algorithms, 42
  2. Bell, 1977, A Course in Mathematical Logic
  3. Péter, 1967, Recursive Functions
  4. Davis, 1965, The Undecidable
  5. Kleene, 1967, Mathematical Logic
  6. Brainerd, 1974, Theory of Computation
  7. Cobham, 1965, Proceedings of the 1964 International Congress for Logic, Methodology and Philosophy of Science, 24-30
  8. Van der Waerden, 1949, Modern Algebra, 1
  9. Gödel, 1931, Uber formal unentscheidbare Sätze der Principia Mathematica und verwandter System I, Monatschefte Math. Phys, 38, 173-98
  10. Church, 1936, Am. J Math, 58, 345-63
  11. Tarski, 1953, Undecidable Theories
  12. Cohn, 1977, Algebra,, 2
  13. Kleene, 1952, Introduction in Metamathematics
  14. Bird, 1976, Programs and Machines

Cited by

See all 443

Metadata

Authors
Cutland, N.
Affiliations
University of York (GB)
Corresponding author
Cutland, Nigel
Venue
Cambridge University Press eBooks
Published
1980-06-19
OpenAlex
W4247585886
Cited by
206
References
34
Citations by year
2026: 5 · 2025: 3 · 2024: 8 · 2023: 3 · 2022: 3 · 2021: 1 · 2020: 4 · 2019: 29 · 2018: 6 · 2017: 4 · 2016: 8 · 2015: 5 · 2014: 7 · 2013: 4 · 2012: 6
FWCI
0.27
Type
book
Language
en
Open access
closed
Locations
Cambridge University Press eBooks (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
  • Physical Sciences › Computer Science › Software › Logic, programming, and type systems
Keywords
computability theory, computability, recursive functions, register machines, undecidability, non-computability, computably enumerable sets, recursive sets, Gödel's incompleteness theorems, Turing degrees, recursion theorem

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: Computability: An introduction to recursive function theory. https://app.cochat.ai/papers/10.1017/cbo9781139171496
The paper
Cutland, N. (1980). Computability: An introduction to recursive function theory. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9781139171496

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.