Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Smn_theorem> ?p ?o. }
Showing items 1 to 24 of
24
with 100 items per page.
- Smn_theorem abstract "In computability theory the smn theorem, (also called the translation lemma, parameter theorem, or parameterization theorem) is a basic result about programming languages (and, more generally, Gödel numberings of the computable functions) (Soare 1987, Rogers 1967). It was first proved by Stephen Cole Kleene (Kleene 1943).In practical terms, the theorem says that for a given programming language and positive integers m and n, there is a particular algorithm that operates on the source code of programs with m + n free variables. This algorithm produces source code that effectively substitutes m given values for the first m free variables in the program and leaves the rest free.".
- Smn_theorem wikiPageExternalLink Kleene%20-%20Ordinals.pdf.
- Smn_theorem wikiPageID "2330936".
- Smn_theorem wikiPageRevisionID "595755549".
- Smn_theorem hasPhotoCollection Smn_theorem.
- Smn_theorem title "Kleene's s-m-n Theorem".
- Smn_theorem urlname "Kleeness-m-nTheorem".
- Smn_theorem subject Category:Computability_theory.
- Smn_theorem subject Category:Theory_of_computation.
- Smn_theorem comment "In computability theory the smn theorem, (also called the translation lemma, parameter theorem, or parameterization theorem) is a basic result about programming languages (and, more generally, Gödel numberings of the computable functions) (Soare 1987, Rogers 1967).".
- Smn_theorem label "Smn theorem".
- Smn_theorem label "Smn-Theorem".
- Smn_theorem label "Smn定理".
- Smn_theorem label "Teorema S m n".
- Smn_theorem label "Théorème d'itération".
- Smn_theorem sameAs Smn-Theorem.
- Smn_theorem sameAs Théorème_d'itération.
- Smn_theorem sameAs Teorema_S_m_n.
- Smn_theorem sameAs Smn定理.
- Smn_theorem sameAs m.074991.
- Smn_theorem sameAs Q1766814.
- Smn_theorem sameAs Q1766814.
- Smn_theorem wasDerivedFrom Smn_theorem?oldid=595755549.
- Smn_theorem isPrimaryTopicOf Smn_theorem.