Anonymous function: Function (mathematics), Subroutine, Name binding, Identifier, Alonzo Church, Lambda calculus, Anonymous recursion, Alan Turing - Tapa blanda
Sinopsis
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computing, an anonymous function is a function (or a subroutine) defined, and possibly called, without being bound to an identifier. Anonymous functions originate in the work of Alonzo Church in his invention of the lambda calculus in 1936 (prior to electronic computers), in which all functions are anonymous. The Y combinator can be utilised in these circumstances to provide anonymous recursion, which Church used to show that some mathematical questions are unsolvable by computation. (Note: this result was disputed at the time, and one year later his student Alan Turing provided a proof that was more generally accepted.)
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computing, an anonymous function is a function (or a subroutine) defined, and possibly called, without being bound to an identifier. Anonymous functions originate in the work of Alonzo Church in his invention of the lambda calculus in 1936 (prior to electronic computers), in which all functions are anonymous. The Y combinator can be utilised in these circumstances to provide anonymous recursion, which Church used to show that some mathematical questions are unsolvable by computation. (Note: this result was disputed at the time, and one year later his student Alan Turing provided a proof that was more generally accepted.)
"Sobre este título" puede pertenecer a otra edición de este libro.
Resultados de la búsqueda para Anonymous function: Function (mathematics), Subroutine,...
Imagen del vendedor
Anonymous function
Publicado por
Omniscriptum Mär 2026, 2026
ISBN 10: 6130814364
ISBN 13: 9786130814366
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 -High Quality Content by WIKIPEDIA articles! In computing, an anonymous function is a function (or a subroutine) defined, and possibly called, without being bound to an identifier. Anonymous functions originate in the work of Alonzo Church in his invention of the lambda calculus in 1936 (prior to electronic computers), in which all functions are anonymous. The Y combinator can be utilised in these circumstances to provide anonymous recursion, which Church used to show that some mathematical questions are unsolvable by computation. (Note: this result was disputed at the time, and one year later his student Alan Turing provided a proof that was more generally accepted.) 188 pp. Englisch. Nº de ref. del artículo: 9786130814366
Comprar nuevo
EUR 54,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
Anonymous function : Function (mathematics), Subroutine, Name binding, Identifier, Alonzo Church, Lambda calculus, Anonymous recursion, Alan Turing
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 - High Quality Content by WIKIPEDIA articles! In computing, an anonymous function is a function (or a subroutine) defined, and possibly called, without being bound to an identifier. Anonymous functions originate in the work of Alonzo Church in his invention of the lambda calculus in 1936 (prior to electronic computers), in which all functions are anonymous. The Y combinator can be utilised in these circumstances to provide anonymous recursion, which Church used to show that some mathematical questions are unsolvable by computation. (Note: this result was disputed at the time, and one year later his student Alan Turing provided a proof that was more generally accepted.). Nº de ref. del artículo: 9786130814366
Comprar nuevo
EUR 54,65
Envío por EUR 61,49
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
Anonymous function | Function (mathematics), Subroutine, Name binding, Identifier, Alonzo Church, Lambda calculus, Anonymous recursion, Alan Turing
Impresión bajo demandaLibrería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Anonymous function | Function (mathematics), Subroutine, Name binding, Identifier, Alonzo Church, Lambda calculus, Anonymous recursion, Alan Turing | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130814366 | 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: 113248092
Comprar nuevo
EUR 171,70
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
Anonymous function
Publicado por
Omniscriptum Mär 2026, 2026
ISBN 10: 6130814364
ISBN 13: 9786130814366
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 computing, ananonymous function is a function (or a subroutine) defined, and possiblycalled, without being bound to an identifier. Anonymous functionsoriginate in the work of Alonzo Church in his invention of the lambdacalculus in 1936 (prior to electronic computers), in which all functionsare anonymous. The Y combinator can be utilised in these circumstancesto provide anonymous recursion, which Church used to show that somemathematical questions are unsolvable by computation. (Note: this resultwas disputed at the time, and one year later his student Alan Turingprovided a proof that was more generally accepted.)VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 188 pp. Englisch. Nº de ref. del artículo: 9786130814366
Comprar nuevo
EUR 216,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