Theory of Recursive Functions and Effective Computability¶
Rogers, H. J. (1967). Theory of Recursive Functions and Effective Computability. McGraw-Hill.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Decidability Computability
- Lose any one and decidability fails, and the way it fails matters: a procedure that sometimes answers but sometimes loops forever is semi-decidable, a procedure that always terminates but only sometimes correctly is a heuristic, and a procedure that solves some instances but not the whole class is a special-case solver — three distinct failure modes the prime makes visible and keeps apart.
This sourceStandard reference distinguishing decidable, semi-decidable (recursively enumerable), and undecidable problem classes.
- Lose any one and decidability fails, and the way it fails matters: a procedure that sometimes answers but sometimes loops forever is semi-decidable, a procedure that always terminates but only sometimes correctly is a heuristic, and a procedure that solves some instances but not the whole class is a special-case solver — three distinct failure modes the prime makes visible and keeps apart.
Domain-specific¶
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a 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:be5ebc857df9 · see in the full table