Smn定理
1. Smn theoremIn computability theory the smn theorem, (also called the translation lemma, parameter theorem, or parameterization theorem) is a basic result about programming languages (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.
Read “Smn theorem” on English Wikipedia
Read “Smn定理” on Japanese Wikipedia
Read “Smn theorem” on DBpedia
Read “Smn theorem” on English Wikipedia
Read “Smn定理” on Japanese Wikipedia
Read “Smn theorem” on DBpedia
Discussions
Log in to talk about this word.