2836-4449ISSN (Online)
Volume 4 , Issue 1 , PP: 36-49, 2024 | Cite this article as | XML | Html | PDF | Full Length Article
Takaaki Fujita 1 *
Doi: https://doi.org/10.54216/PAMDA.040104
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.
Algorithm , Multialgorithm , Hyperalgorithm , Superhyperalgorithm
[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. IEEE, 2012.
[6] Luciana De Micco, Mariano L Acosta, and Maximiliano Antonelli. Hybrid sorting algorithm implemented by high level synthesis. IEEE Latin America Transactions, 18(02):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] Takaaki Fujita. Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutro- sophic, Soft, Rough, and Beyond. Biblio Publishing, 2025.
[10] Takaaki Fujita. A concise review on various concepts of superhyperstructures. Preprint, 2025.
[11] Takaaki Fujita. Expanding horizons of plithogenic superhyperstructures: Applications in decision-making, control, and neuro systems. Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond, page 416, 2025.
[12] Takaaki Fujita. A theoretical exploration of hyperconcepts: Hyperfunctions, hyperrandomness, hyperdecision-making, and beyond (including a survey of hyperstructures). Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond, 344(498):111, 2025.
[13] Takaaki Fujita and Florentin Smarandache. Superhypergraph neural networks and plithogenic graph neural networks: Theoretical foundations. 2025.
[14] Thomas Jech. Set theory: The third millennium edition, revised and expanded. Springer, 2003. [15] EJC Kelkboom, Xuebing Zhou, Jeroen Breebaart, Raymond NJ Veldhuis, and Christoph Busch. Multi-algorithm fusion with tem- plate 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´ak, ˇStep´an 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 International Conference on Computers Communications and Control, pages 427–432. Springer, 2022.
[25] Florentin Smarandache. Foundation of superhyperstructure & neutrosophic superhyperstructure. Neutrosophic Sets and Systems, 63(1):21, 2024.
[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. 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.
