s-m-n theorem

E1640538 UNEXPLORED

The s-m-n theorem is a fundamental result in computability theory that formalizes how to effectively specialize multi-argument computable functions by “hard-coding” some of their inputs into their program indices.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
s-m-n theorem canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Kleene’s recursion theorem → relatedTo → s-m-n theorem ⓘ