A Novel Approach in Number Theory for Representing Large Numbers: The Arrow-Free Notation
Article Sidebar
This work is licensed under a Creative Commons Attribution 4.0 International License.
Main Article Content
Abstract
This article introduces a new notation for expressing extremely large numbers, based on the hyperoperation concept in group theory. The method employs a finite sequence of positive integers separated by specific notational symbols, allowing for concise representation through an arrow-free notation: ( ), where b represents the number of copies of a, and n denotes the arrow’s number described by a general formula. This recursive definition aims to replace the Knuth up-arrow notation and Conway chained arrow notation, which require the insertion of arrows between or within numbers. The new approach simplifies these expressions, eliminating the need for such symbols and providing a straightforward and concise method for representing large numbers. The aim was to develop a more efficient method, arrow-free notation, reducing the complexity and steps necessary with previous notations.
Downloads
Article Details
References
R. Amadio and Ch. Meyssonnier. On decidability of the control reachability problem in the asynchronous π-calculus. Nordic Journal of Computing, 9(2):70–101, 2002.
R. Rucker, Infinity and the Mind: The Science and Philosophy of the Infinite, Princeton University Press, Princeton, NJ, 2019. 3. P. Chambart and Ph. Schnoebelen. Pumping and counting on the Regular Post Embedding Problem. In Proc. ICALP 2010, Lect. Notes Comp. Sci. Springer, 2010.
R. Munafo, Versions of Ackermann’s Function, Large Numbers at MROB, Retrieved on 19-11-2019. 5. C. Dufourd, P. Jancar, and Ph. Schnoebelen. Boundedness of Reset P/T nets. In ˇ Proc. ICALP’99, volume 1644 of Lect. Notes Comp. Sci., pages 301–310. Springer, 1999.
D. Figueira, S. Figueira, S. Schmitz, and Ph. Schnoebelen. Ackermann and primitive recursive upper bounds with Dickson’s lemma. In preparation, 2010.
R. Munafo, Inventing New Operators and Functions, Large Numbers at MROB, Retrieved on 19-11-2019. 8. A. Finkel, J.-F. Raskin, M. Samuelides, and L. Van Begin. Monotonic extensions of Petri nets: Forward and backward search revisited. In Proc. INFINITY 2002, volume 68(6) of Electronic Notes in Theoretical Computer Science, pages 121–144, 2003.
F. Caldarola, G. d’Atri, P. Mercuri and V. Talamanca, On the arithmetic of Knuth’s powers and some computational results about their density, In: Y.D. Sergeyev and D. Kvasov (eds.) Numerical Computations: Theory and Algorithms NUMTA 2019, Lecture Notes in Computer Science, vol. 11973 (2020), Springer, Cham, 381-388.
F. Caldarola and M. Maiolo, On the topological convergence of multi-rule sequences of sets and fractal patterns, Soft Computing, 24(23) (2020), 17737- 17749. [14] F. Caldarola, M. Maiolo and V. Solferino, A new approach to the Z-transform through infinite computation, Commun. Nonlinear Sci. Numer. Simul., 82 (2020), 105019.
Conway, J. H. and Guy, R. K. The Book of Numbers. New York: Springer-Verlag, pp. 59-62, 1996.
F. Caldarola, G. d’Atri, M. Maiolo and G. Pirillo, The sequence of Carboncettus octagons, In: Y.D. Sergeyev and D. Kvasov (eds.) Numerical Computations: Theory and Algorithms NUMTA 2019, Lecture Notes in Computer Science, vol. 11973 (2020), Springer, Cham, 373-380.
L. Antoniotti, F. Caldarola, G. d’Atri and M. Pellegrini, New approaches to basic calculus: an experimentation via numerical computation, In: Y.D. Sergeyev and D. Kvasov (eds.) Numerical Computations: Theory and Algorithms NUMTA 2019, Lecture Notes in Computer Science, vol. 11973 (2020), Springer, Cham, 329-342.
L. Antoniotti, F. Caldarola and M. Maiolo, Infinite numerical computing applied to Hilbert’s, Peano’s, and Moore’s curves, Mediterr. J. Math., 17(3) (2020), 99 (19 pp).
F. Caldarola, D. Cortese, G. d’Atri and M. Maiolo, Paradoxes of the infinite and ontological dilemmas between ancient philosophy and modern mathematical solutions, In: Y.D. Sergeyev and D. Kvasov (eds.) Numerical Computations: Theory and Algorithms NUMTA 2019, Lecture Notes in Computer Science, vol. 11973 (2020), Springer, Cham, 358-372.