The two efforts to define "the recursive elements of" the completion coincide in the Boolean algebra produced by the recursively regular open sets that are recursively regular open sets. The method described in this article tries to transition between two binary and ternary counting systems. In order to code the signal, I suggest using the ternary math principle. The study suggests utilising triplets (1,0-1) instead of pairs of the number 01 and switching from binary to ternary so that the binary code is transformed to ternary and vice versa. The similar idea can be applied to the construction of microcircuits, in which logical components are arranged in a three-dimensional space rather than a layer. It is determined that the all-ternary approach in algebra is a promising technique as an alternative to the binary approach that has already been devised. If the idea is properly integrated with technical advancements, it could have a greater computational advantage.
Author(s) Details:
Ruslan Pozinkevych,
Faculty of Information Technologies and Mathematics, The Eastern European National University, 43021, Lutsk, Potapov str.9, Ukraine.
Please see the link here: https://stm.bookpi.org/NRAMCS-V8/article/view/8362
No comments:
Post a Comment