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.)
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.)
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9786130814366
Anzahl: 2 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: 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.). Bestandsnummer des Verkäufers 9786130814366
Anzahl: 1 verfügbar
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 113248092
Anzahl: 5 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9786130814366
Anzahl: 1 verfügbar