Theory of Recursive Functions and Effective Computability (Hartley Rogers, Jr.)

Shoenfield, J. R. (1969). Theory of Recursive Functions and Effective Computability (Hartley Rogers, Jr.).

Type

Unclassified

Intellectual base

Unclassified

Year

1969

DOI

10.1137/1011079

Link

https://doi.org/10.1137/1011079

Cited by

1 citation across 1 artifact.

Domain-specific

• Enumeration reducibility
  • A is enumeration-reducible to B when a computably enumerable set of finite-premise rules outputs exactly A from positive membership information enumerated for B, independent of enumeration order and delay.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:d913fc900ce7 · see in the full table