Smn Theorem: Recursion Theory, Programming Language, Gödel Numbering, Computable Function, Stephen Cole Kleene, Algorithm - Tapa blanda
Resultados de la búsqueda para Smn Theorem: Recursion Theory, Programming Language,...
Imagen del vendedor
Smn Theorem
Publicado por
Omniscriptum Mär 2026, 2026
ISBN 10: 6131243433
ISBN 13: 9786131243431
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 effectively binds m given values to the first m free variables in the program and leaves the rest free. 108 pp. Englisch. Nº de ref. del artículo: 9786131243431
Comprar nuevo
EUR 39,00
Envío por EUR 23,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Smn Theorem : Recursion Theory, Programming Language, Gödel Numbering, Computable Function, Stephen Cole Kleene, Algorithm
Impresión bajo demandaLibrería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 effectively binds m given values to the first m free variables in the program and leaves the rest free. Nº de ref. del artículo: 9786131243431
Comprar nuevo
EUR 40,58
Envío por EUR 60,90
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Smn Theorem | Recursion Theory, Programming Language, Gödel Numbering, Computable Function, Stephen Cole Kleene, Algorithm
Impresión bajo demandaLibrería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Smn Theorem | Recursion Theory, Programming Language, Gödel Numbering, Computable Function, Stephen Cole Kleene, Algorithm | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131243431 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 113286829
Comprar nuevo
EUR 125,30
Envío por EUR 70,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen del vendedor
Smn Theorem
Publicado por
Omniscriptum Mär 2026, 2026
ISBN 10: 6131243433
ISBN 13: 9786131243431
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In computabilitytheory the smn theorem, (also called the translation lemma, parametertheorem, or parameterization theorem) is a basic result aboutprogramming languages (and, more generally, Gödel numberings of thecomputable functions) (Soare 1987, Rogers 1967). It was first proved byStephen Cole Kleene (Kleene 1943). In practical terms, the theorem saysthat for a given programming language and positive integers m and nthere is a particular algorithm that operates on the source code ofprograms with m+n free variables. This algorithm effectively binds mgiven values to the first m free variables in the program and leaves therest free.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 108 pp. Englisch. Nº de ref. del artículo: 9786131243431
Comprar nuevo
EUR 156,00
Envío por EUR 60,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles