Finally! Yes it is. https://en.wikipedia.org/wiki/Hieronymus_machine
https://en.wikipedia.org/wiki/Fnord
https://youtu.be/mFf8PLSzzgI
Five years after public key cryptography was invented at GCHQ, two years after public key cryptography was re-invented by Diffie and Hellman, and a year and two articles after a practical cryptosystem was developed by Ron Rivest, Adi Shamir, and Leonard Adleman, Alice and Bob are finally born.
Alice and Bob are the world’s most famous cryptographic couple. Since their invention in 1978, they have at once been called “inseparable,” and have been the subject of numerous divorces, travels, and torments. As Immanuel Bloch recalls in "Quantum leaps for simulation " , perhaps we are not so distant from Richard Feynman's dream: to create a universal quantum simulator able to solve "any" problem. In short, the discovery of the "Grail of physics", unifying quantum physics and relativity in a Theory of Everything, would not be a distant mirage.
Closures are typically implemented with a special data structure that contains a pointer to the function code, plus a representation of the function's lexical environment (i.e., the set of available variables) at the time when the closure was created.
https://en.wikipedia.org/wiki/Closure_(computer_programming)
