Translational discourse requires at least three participants, therefore it is suggested to consider the universal model of the picture of the world, according to which it is much easier for a translator to combine the...Translational discourse requires at least three participants, therefore it is suggested to consider the universal model of the picture of the world, according to which it is much easier for a translator to combine the pictures of the world of an addressee and an author. An addressee is a mental image existing in the mind of an addresser during the creative process. Having defined its parameters, a translator has an opportunity to deliver the thought of an addresser to an addressee as accurately as possible and to select the means of expression that are clear to an addressee. The type of an addressee correlates with ＂the relation to the new＂.展开更多
We introduce a pictorial approach to quantum information, called holographic software. Our software captures both algebraic and topological aspects of quantum networks. It yields a bi-directional dictionary to transla...We introduce a pictorial approach to quantum information, called holographic software. Our software captures both algebraic and topological aspects of quantum networks. It yields a bi-directional dictionary to translate between a topological approach and an algebraic approach. Using our software, we give a topological simulation for quantum networks. The string Fourier transform(SFT) is our basic tool to transform product states into states with maximal entanglement entropy. We obtain a pictorial interpretation of Fourier transformation, of measurements, and of local transformations, including the n-qudit Pauli matrices and their representation by Jordan-Wigner transformations. We use our software to discover interesting new protocols for multipartite communication. In summary, we build a bridge linking the theory of planar para algebras with quantum information.展开更多
Introduce heuristically the newly definitioll (W. Thomas) for graph automata - using'tiles' to simulste the extension (over dag's) of the classical notions of transition moves; proposea sufficient conditio...Introduce heuristically the newly definitioll (W. Thomas) for graph automata - using'tiles' to simulste the extension (over dag's) of the classical notions of transition moves; proposea sufficient condition for when graph automata can be reduced to (simpler) tiling systerms, whichis a generalisation of a Thomas' result; and finally study the logic sepcification of tiling systems(paticularly, over picture languages) by (existential) monadic partition logic, instead of theususal and stronger framework (E)MSQ.展开更多
文摘Translational discourse requires at least three participants, therefore it is suggested to consider the universal model of the picture of the world, according to which it is much easier for a translator to combine the pictures of the world of an addressee and an author. An addressee is a mental image existing in the mind of an addresser during the creative process. Having defined its parameters, a translator has an opportunity to deliver the thought of an addresser to an addressee as accurately as possible and to select the means of expression that are clear to an addressee. The type of an addressee correlates with ＂the relation to the new＂.
基金supported by the Templeton Religion Trust(Grant Nos.TRT0080 and TRT0159)
文摘We introduce a pictorial approach to quantum information, called holographic software. Our software captures both algebraic and topological aspects of quantum networks. It yields a bi-directional dictionary to translate between a topological approach and an algebraic approach. Using our software, we give a topological simulation for quantum networks. The string Fourier transform(SFT) is our basic tool to transform product states into states with maximal entanglement entropy. We obtain a pictorial interpretation of Fourier transformation, of measurements, and of local transformations, including the n-qudit Pauli matrices and their representation by Jordan-Wigner transformations. We use our software to discover interesting new protocols for multipartite communication. In summary, we build a bridge linking the theory of planar para algebras with quantum information.
文摘Introduce heuristically the newly definitioll (W. Thomas) for graph automata - using'tiles' to simulste the extension (over dag's) of the classical notions of transition moves; proposea sufficient condition for when graph automata can be reduced to (simpler) tiling systerms, whichis a generalisation of a Thomas' result; and finally study the logic sepcification of tiling systems(paticularly, over picture languages) by (existential) monadic partition logic, instead of theususal and stronger framework (E)MSQ.
