Memory trees and Taylor expansion of the lambda|-calculus (2012) [pdf]
The article discusses the concepts of memory trees and Taylor expansion within the context of lambda calculus. It explores how these mathematical tools can be applied to enhance understanding of computational processes. The implications of these concepts for theoretical computer science are also considered.
- ▪Memory trees are a structure used to represent the state of computation in lambda calculus.
- ▪Taylor expansion provides a method for approximating functions, which can be applied to lambda calculus.
- ▪The article highlights the relevance of these concepts to advancements in theoretical computer science.
Opening excerpt (first ~120 words) tap to expand
�&���4 ��h�³�*0.���h��ǎAr�@�og!��@���0Z�������ݛ��9�m|�ڼ�_h���Y��l��Û��l�y �a|���10��T PE&&d���#/~Z2�(/�)��Ur C$������f�S�F=5��Ю{I��P�zU Om"���t�P;W��_A#` ���WU:àn6�hmb��5��t���[ǀ��i�es�x�%��B����)� ^�����T$�2� P+��!�h�my�̈1堫2��DR�,ːu���� ����q��|�#��=݆ nbM`4e5������)�mx�y�17P}]]����f��R�p���B���p� �P�{� ��!�$l��g��Z��%�/ ��qS �-ld~�w�S�S!�O��������)�(ك0{E�G����{���yސ ܃���} �+?��=�hQ�o�u�D� ߟ�� S:���$��A����Q�S��+<��.��>� ���z5�t��e�P6�]�J=��R�8�)p�.�tum�Ib�v�o,� 8:3�&|xohٝ&�4q��a/A��O�@0言����E&�V撕� '��>�z� p��ћ�I��X �c�����L�R���T� +�L�q_�, ���L���˄��"ܩ�l�s����K6�>�c' �Y�:�2�٠`��] r �&p��Ml�ZTJ % S ��t�;L���g+��iW�� V^d�4��y�.����/r��+���� ^n��� T���U�H���ɹ�d�� �[a0&�6�71��US�v z����o�{�C���ɂ�.�c�L��!�邹�…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Irif.
Discussion
0 commentsMore from Irif
