Computability

Cutland, N. J. (1980). Computability: An Introduction to Recursive Function Theory. Cambridge University Press.

Type

Book chapter

Intellectual base

Textbook

Year

1980

DOI

10.1017/cbo9781139171496.006

ISBN

9780521223843

DOI registrant

Cambridge University Press

Link

https://doi.org/10.1017/cbo9781139171496.006

Cited by

1 citation across 1 artifact.

Domain-specific

• S-m-n Theorem
  • Cutland presents this as Kleene’s S-m-n theorem in the theory of effective program numberings.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:107214ab0fa2 · see in the full table