Smn theorem
id:
smn-theorem-298-4613173
title:
Smn theorem
text:
In computability theory the S mn theorem, written also as "smn-theorem" or "s-m-n theorem" is a basic result about programming languages. It was first proved by Stephen Cole Kleene (1943). The name S mn comes from the occurrence of an S with subscript n and superscript m in the original formulation of the theorem. In practical terms, the theorem says that for a given programming language and positive integers m and n, there exists a particular algorithm that accepts as input the source code of
brand slug:
wiki
category slug:
encyclopedia
description:
On transforming a program by substituting constants for free variables
original url:
https://en.wikipedia.org/wiki/Smn_theorem
date created:
date modified:
2024-01-18T22:02:48Z
main entity:
{"identifier":"Q1766814","url":"https://www.wikidata.org/entity/Q1766814"}
image:
fields total:
13
integrity:
14