Recursively Enumerable Sets and Degrees

Soare, R. I. (1987). Recursively Enumerable Sets and Degrees. Springer.

Type

Book

Intellectual base

Review or monograph

Year

1987

Link

no authoritative link yet

Cited by

2 citations across 2 artifacts.

Domain-specific

• Creative and Productive Sets
  • A set C is creative when C is computably enumerable and its complement is productive.
• Reduction (Computability Theory)
  • It is not automatically polynomial-time: classical computability reductions constrain effectiveness and oracle access, not necessarily time or space.

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:1375a3bf5ab3 · see in the full table