KnowraComputable functionLinked fromLinked fromThe 15 pages that link to Computable function, each with the reason it gives.All 15Broader topic 1Related 7Narrower topic 7Many-one reductionNarrower topic: The transforming map must be computable for the reduction to be effective.Universal Turing machineNarrower topic: Turing machines provide a formal model for computing such functions.Primitive recursive functionNarrower topic: Primitive recursive functions form a strict subclass of the total computable functions.Arithmetical hierarchyNarrower topic: Computable predicates provide the basic tests inside definitions at every level.Kleene's recursion theoremNarrower topic: The theorem applies to effective transformations represented by computable operations on indices.Blum's speedup theoremNarrower topic: The theorem concerns programs computing one fixed computable function.S-m-n theoremNarrower topic: The theorem’s partial functions generalize this total, everywhere-defined case.