Recursively Enumerable Sets and Degrees

Robert I. Soare, R. E. S., Functions, D. A. S. o. C., & Computably Generated Sets, S. (1987). Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets. Springer.

Type

Book

Intellectual base

Review or monograph

Year

1987

DOI

10.1007/978-3-662-02460-7

ISBN

9783540666813

Link

https://doi.org/10.1007/978-3-662-02460-7

Cited by

1 citation across 1 artifact.

Domain-specific

• Truth-table reduction
  • … with a fixed negation convention if allowed by the chosen formulation. to A total Turing functional on Cantor space gives a truth-table reduction because compactness of \(2^\omega\) yields, for each input, a finite uniform amount of oracle information sufficient to determine the output. demonstrates that continuity.

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:0d5c199bb379 · see in the full table