parameterized recursion theorem

E1640539 UNEXPLORED

The parameterized recursion theorem is a generalization of Kleene’s recursion theorem in computability theory that allows the construction of self-referential programs whose behavior can additionally depend on an external parameter.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
parameterized recursion theorem canonical	1

Referenced by (1)

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

Kleene’s recursion theorem → hasVariant → parameterized recursion theorem ⓘ