Volume 4 • Issue 1 • PP: 23 –31 • 2024
Hyperalgorithms & Superhyperalgorithms: A Unified Framework for Higher-Order Computation
Open Access & Copyright
© 2024 The Author(s). Published by ASPG. This article is licensed under the Creative Commons Attribution 4.0 International License (CC BY 4.0).
View PDF Abstract
An algorithm is a finite, well-defined computational procedure that transforms inputs into outputs through a structured sequence of steps, guaranteeing termination and correctness. A multialgorithm comprises multiple algorithms augmented with a selection mechanism that dynamically chooses the most appropriate procedure based on input characteristics or contextual conditions. While these concepts have deep roots in computer science and beyond, this paper introduces two novel generalizations: the Hyperalgorithm and the Superhyper- algorithm. By leveraging the mathematical frameworks of hyperstructures and superhyperstructures, respectively, we extend the classical notion of computation to higher-order operations on sets and iterated powersets. We present formal definitions, illustrative examples, and a preliminary analysis of their computational properties, laying the groundwork for a unified theory of higher-order algorithms.
Keywords
References
[1] Guy E. Blelloch. Programming parallel algorithms. Communications of the ACM, 39(3):85–97, 1996.
[2] You-Rong Chen, Chien-Chia Ho, Wei-Ting Chen, and Pei-Yin Chen. A low-cost pipelined architecture based on a hybrid sorting algorithm. IEEE Transactions on Circuits and Systems I: Regular Papers, 71(2):717–730, 2023.
[3] Richard Cole. Parallel merge sort. SIAM Journal on Computing, 17(4):770–785, 1988.
[4] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. MIT Press, 2022.
[5] Andrew Davidson, David Tarjan, Michael Garland, and John D. Owens. Efficient parallel merge sort for fixed and variable length keys, 2012.
[6] Luciana De Micco, Mariano L. Acosta, and Maximiliano Antonelli. Hybrid sorting algorithm implemented by high level synthesis. IEEE Latin America Transactions, 18(2):430–437, 2019.
[7] Pedro S. de Souza and Sarosh N. Talukdar. Asynchronous organizations for multi-algorithm problems. In Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing: States of the Art and Practice, pages 286–293, 1993.
[8] John D. Dixon. The number of steps in the euclidean algorithm. Journal of Number Theory, 2(4):414–422, 1970.
[9] Florentin Smarandache. Extension of hypergraph to nsuperhypergraph and to plithogenic n-superhypergraph, and extension of hyperalgebra to n-ary (classical- /neutro-/anti-) hyperalgebra. Neutrosophic Sets and Systems, 33(1):290–296, 2020.
[10] Florentin Smarandache. Superhyperfunction, superhyperstructure, neutrosophic superhyperfunction and neutrosophic superhyperstructure: Current understanding and future directions. Neutrosophic Systems with Applications, 12(1):68–76, 2023.
[11] Florentin Smarandache and Nivetha Martin. Plithogenic n-super hypergraph in novel multi-attribute decision making. International Journal of Neutrosophic Science, 7(1):8–30, 2020.
[12] Florentin Smarandache. The superhyperfunction and the neutrosophic superhyperfunction. Neutrosophic Sets and Systems, 49(1):594–600, 2022.
[13] Florentin Smarandache. Introduction to the nsuperhypergraph— the most general form of graph today. Neutrosophic Sets and Systems, 48(1):483–485, 2022.
[14] Thomas Jech. Set Theory: The Third Millennium Edition, Revised and Expanded. Springer, 2003.
[15] E. J. C. Kelkboom, Xuebing Zhou, Jeroen Breebaart, Raymond N. J. Veldhuis, and Christoph Busch. Multialgorithm fusion with template protection. In 2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems, pages 1–8. IEEE, 2009.
[16] F. Thomson Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Elsevier, 2014.
[17] Th. Motzkin. The euclidean algorithm, 1949.
[18] Michal Novák, Štˇepán Kˇrehlík, and Kyriakos Ovaliadis. Elements of hyperstructure theory in uwsn design and data aggregation. Symmetry, 11(6):734, 2019.
[19] Judith Roitman. Introduction to Modern Set Theory, volume 8. John Wiley & Sons, 1990.
[20] Robert Sedgewick and Kevin Wayne. Algorithms. Addison-Wesley Professional, 2011.
[21] Jeffrey Shallit. Origins of the analysis of the euclidean algorithm. Historia Mathematica, 21(4):401–419, 1994.
[22] Steven S. Skiena. The Algorithm Design Manual, volume 2. Springer, 2008.
[23] F. Smarandache. Introduction to superhyperalgebra and neutrosophic superhyperalgebra. Journal of Algebraic Hyperstructures and Logical Algebras, 2022.
[24] Florentin Smarandache. Extension of hyperalgebra to superhyperalgebra and neutrosophic superhyperalgebra (revisited). In Simona Dzitac, Domnica Dzitac, Florin Gheorghe Filip, Janusz Kacprzyk, Misu- Jan Manolescu, and Horea Oros, editors, Intelligent Methods Systems and Applications in Computing, Communications and Control, volume 1435 of Advances in Intelligent Systems and Computing, pages 427–432. Springer, Cham, 2023.
[25] Marzieh Rahmati and Mohammad Hamidi. Extension of g-algebras to superhyper g-algebras. Neutrosophic Sets and Systems, 55(1):557–567, 2023.
[26] Kouichi Takahashi, Kazunari Kaizu, Bin Hu, and Masaru Tomita. A multi-algorithm, multi-timescale method for cell simulation. Bioinformatics, 20(4):538– 546, 2004.
[27] Souzana Vougioukli. Helix hyperoperation in teaching research. Science & Philosophy, 8(2):157–163, 2020.
[28] Souzana Vougioukli. Hyperoperations defined on sets of s-helix matrices. Journal of Algebraic Hyperstructures and Logical Algebras, 1(3):81–90, September 2020.
[29] Thomas Vougiouklis. Hyperstructures and Their Representations. Hadronic Press, 1994.
[30] Ming Xu, Xianbin Xu, Fang Zheng, Yuanhua Yang, and Mengjia Yin. A hybrid sorting algorithm on heterogeneous architectures. TELKOMNIKA (Telecommunication Computing Electronics and Control), 13(4):1399– 1407, 2015.
Cite This Article
Choose your preferred format
Publisher's Note
The statements, opinions, and data presented in this article are solely those of the author(s) and do not necessarily represent those of ASPG, the journal, or its editors. ASPG and the editors disclaim responsibility for any harm arising from the use of any ideas, methods, instructions, or products described in this article, to the fullest extent permitted by applicable law.