DOCSLIB.ORG

Fractional Mathematical Operators and Their Computational Approximation

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Fractional Mathematical Operators and Their Computational Approximation Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2016, Article ID 4356371, 11 pages http://dx.doi.org/10.1155/2016/4356371 Research Article Fractional Mathematical Operators and Their Computational Approximation José Crespo and Francisco Javier Montáns Escuela Tecnica´ Superior de Ingenier´ıa Aeronautica´ y del Espacio, Universidad Politecnica´ de Madrid, Plaza Cardenal Cisneros 3, 28040 Madrid, Spain Correspondence should be addressed to Francisco Javier Montans;´ [email protected] Received 27 January 2016; Revised 30 July 2016; Accepted 9 August 2016 Academic Editor: Manuel Doblare´ Copyright © 2016 J. Crespo and F. J. Montans.´ This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Usual applied mathematics employs three fundamental arithmetical operators: addition, multiplication, and exponentiation. However, for example, transcendental numbers are said not to be attainable via algebraic combination with these fundamental operators. At the same time, simulation and modelling frequently have to rely on expensive numerical approximations of the exact solution. The main purpose of this article is to analyze new fractional arithmetical operators, explore some of their properties, and devise ways of computing them. These new operators may bring new possibilities, for example, in approximation theory and in obtaining closed forms of those approximations and solutions. We show some simple demonstrative examples. 1. Introduction parameters [2, 3] rendering linear equations. We will also see possible applications of the presented operators in constitu- Science mostly hinges on mathematics which has been built tive modelling. on three fundamental operations: the addition, the multipli- Consider the classification described in Table 1. cation, and the exponentiation. We have become extremely As observed in Table 1, in the last column, exponentiation used to them. However, the rigidity of these preset tools may is expressed in terms of a higher operation. This operation is attimesmakeitdifficulttofindwaysandsolutionsfornature called tetration and is commonly considered as the first hyper- problems that are not easily expressed in terms of traditional operation because it has a higher rank (=4) than exponenti- operators. For example, transcendental numbers are said not ation (=3). Preliminary and fundamental works in this line to be attainable via algebraic combination with these funda- have been performed by Peano [4] with his Peano Arithmetic mental operators, which are a long standing human inven- axioms, Ackermann [5] with the nonprimitive recursive func- tion. At the same time, simulation and modelling have to deal tions, and Goodstein [6] with the hyperoperational sequence, with some situations in which the only solution is to compute among others. an expensive numerical approximation of the exact solution, However, intermediate-rank operations are also possible which frequently cannot be written in closed form in terms and may be useful. The problem we address is how to compute of traditional operators. a hyperoperation of rank =3/2(from now on, 3/2). To The purpose of this work is to present and apply some this respect, this was already an open question formulated operations beyond the rigidity of the known fundamental byRutsovandRomerio[7]orWilliams[8].Wewillfirstset operations, such as an intermediate operation between addi- the proper environment, namely, the arithmetical continuous tion and multiplication. The ideas have some parallelism spectrum. Some definitions are useful to understand some with fractional derivatives [1] which, for example, allow the properties that are going to be necessary to compute 3/2,as accurate characterization of viscous materials with just two well as to establish a comfortable notation for our purposes. 2 Mathematical Problems in Engineering Table 1: Hierarchical classification of fundamental operations. Op. rank, Operational name Conventional notation Rank-wise notation (()) = ( + 1) +1⋅ =⋅2 0 Successor 0 1 +=⋅2 ⋅=⋅2 1 Addition 1 2 ⋅=2 ⋅=⋅2 2 Multiplication 2 3 = 2⋅=⋅2 3 Exponentiation # 3 4 2. The Arithmetical Continuous Spectrum Table 2: Proposed hyperoperational notation. The arithmetical continuous spectrum focuses on the idea of Operationalnature Notation Operation Example(=3) ⋅ ⋅=3=2 2⋅ 3 =8 having a continuous spectrum of arithmetical operations as it Direct 3 3 occurs with real numbers. Here we note that there are many R-inverse / /=3= 8/ √8=2 possibilities to define hyperoperations of intermediate ranks. 3 L-inverse \ \=2= 8\ log2(8) = 3 The reader is referred to the explanation and discussion in [9]. 3 The fractional operators that are herein defined have the pur- pose of seeking improved and more compact interpolations in engineering fields in general and in constitutive modelling / = = / in particular. 2 In order to connect operations of different ranks, the H \ = = / environment set of hyperoperations must be previously 2 defined. For this purpose, a set of definitions and lemmas will facilitate the task of establishing fractional hyperoperators so (⋅) / (∗) ≡ (⋅) \ (∗) ≡ (⋅) / (∗) . 2 2 and their computational approximations. (1) Definition 1. Let H be the set that contains every binary hyperoperation of rank , ∈ R. H ⊂ H is the space of For instance, in the case of rank =3, the relations between integer rank hyperoperations, and H ⊂ H is the space of the base , the exponent ,andtheresult are as follows: fractional rank hyperoperations; that is, H ⊂ H ⊂ H. =2 The suggested notation described in Table 2 will be employed in order to extend a universal notation for hyper- ⇓ operations of rank ∈R. Consider , , ∈ R,whichresem- =⋅= bles the notion of base, exponent, and result, respectively. 3 The names of R- and L-inverses remind those of root-kind inverse and log-kind inverse, but note that the notation is also √ =/=(⋅)= / (2) such that the bar is slanted right for the R-inverse operator 3 3 3 and left for the L-inverse operator. Some trivial particular cases are those for =1and =2 log=\=(⋅) \ = 3 3 3 =1 so (⋅) / (∗) ≠ (⋅) \ (∗) . 3 3 ⇓ Definition 2 (hyperoperational mean). All rank arithmeti- +=⋅= H 1 cal operation in has a corresponding hyperoperational mean, which is defined in the following way: /==− 1 (, ) = (⋅ ) / 2, >. (3) \==− +1 1 This definition is the natural extension of ranks =1 so (⋅) / (⋅) ≡ (⋅) \ (⋅) ≡ (⋅) − (⋅) =2 1 1 (arithmetical mean) and (geometrical mean), =2. + 1 (, ) = =(⋅)2, / 2 1 ⇓ 2 (4) 2 ⋅=⋅= 2 (, ) = √⋅=(⋅) /2. 2 2 3 Mathematical Problems in Engineering 3 Definition 3 (hyperoperational sequence, HS). Hyperopera- According to Definition 5, an example of rank =1is tional sequence of base is a sequence HS(, ) so that the shown. RS1(3, ) satisfy arithmetical mean, 1, th term is 1 +−1 −1 :1 (1,−1)=0 = , = ⋅ = (, ) ; 2 +1 HS (5) −1 =(0 ⋅2)−1 =(0 ⋅ 2) \ 1 =0⋅2−3=−3, that is, 2 1 (, ) ≡ { } HS 0 =1 =0, ={...,(),(⋅) , ( ⋅ ⋅),...} 1 ==3, (6) + : ( , )= = 0 2 , ={..., ⋅ 1, ⋅ 2, ⋅ 3,...}. 2 1 2 0 1 2 +1 +1 +1 2 =(1 ⋅2)−0 =(1 ⋅ 2) /0 =6−0=6, Definition 4 (neutral element). The neutral element for 2 1 hyperoperations of rank is the number such that (14) 3 =(2 ⋅ 2) /1 =12⋅2−3=9, ⋅ = 2 1 (7) andthenobviously 4 =(3 ⋅ 2) /2 =18⋅2−6=12, 2 1 / =, 5 =(4 ⋅ 2) /3 =24⋅2−9=15, (8) 2 1 \=. . Definition 5 (recursive sequence, RS). Let a recursive (, ) sequence RS ,ofrank ,base , and neutral element , =(−1 ⋅ 2) /−2 =3⋅=3⋅=⋅. 2 1 2 2 be the sequence built by its corresponding mean, ,andthe following pair of starting values: As another example, consider this time rank =3. RS3(3, ) must satisfy the corresponding hyperoperational {0,1} = {,} . (9) mean, 3, The sequence can be run either forwards (direct values) = =1, in this way, 0 3 1 ==3, 2 =( ⋅ 2) /, (10) +1 2 :3 (3,1)=2, or backwards (inverse values), in this way √0 1 3 3 2 =(1 ⋅ 2) /0 = 1 =3 =27=3⋅2=3, 4 3 4 =( ⋅ 2) \ . (15) −1 (11) 3 3 +1 √1 2 √ 27 3 3 =(2 ⋅ 2) /1 = 2 = 27 =3⋅3=3 , 4 3 4 Generally, RS is based on the relation that adjacent terms . satisfy. This relation is the hyperoperational mean . (−1,+1)=, =(−1 ⋅ 2) /−2 =⋅. (12) 4 3 4 ( ⋅ )/2=. −1 +1 +1 It can be checked that this makes recursive sequences, RS, coincide up to rank =3,∈N,withthecorresponding If solved for +1 the forwards direction of RS is obtained. hyperoperational sequences, HS. In turn, they also coincide On the contrary, if solved for −1 it yields the expression of with the Goodstein function if the neutral elements are the backwards direction same for the corresponding rank of the Goodstein function; that is, +1 =( ⋅ 2) /−1 forwads, +1 (13) 1 =0, (16) −1 =( ⋅ 2) \ −1 backwards. +1 =1, >1,∈N. 4 Mathematical Problems in Engineering Lemma 9 (RS starting set). Let RS(, ) be a recursive m2 (S2 (2,2, 1) ,S, S2 (2,2, 9)) =m= m2 (S2 (2,2, 2) ,S, S2 (2,2, 8)) =m= m2 (S2 (2,2, 4) ,S, S2 (2, 6)) sequence of base .Then,thefirstthreetermsofRS(, ) are √21 ·2· 29 = √22 ·2· 28 = √24 ·2· 26 =32= 32 {⋅0, ⋅ 1, ⋅ 2} = {,, ⋅ 2} +1 +1 +1 +1 (21) m1 (S1 (2,2, 1) ,S, S1 (2,2, 9)) =m= m1 (S1 (22,, 2) ,S, S1 (2,2, 8)) =m= m1 (S1 (2,2, 4) ,S, S1 (2,2, 6)) 2·1+2·92 · 1 + 2 · 9 22·2+2·8· 2 + 2 · 8 22·4+2·6· 4 + 2 · 6 the term being the right neutral element of +1. = = =10= 10 2 2 2 Proof. The right neutrality of with ≥2is imposed to the 022 4 8 1616 32 64 7 8 9 10 n 2 2 2 2 2 =1 ⋅1= value of due to multiplicative recursion, +1 . According to Definition 5, 0 2 4 6 8 10 12 141616 18 20 2·n (2,0)=1, 1 2 3 4 5 6 7 8 9 10 n 0 0 =, (22) Inch 6 5 4 3 2 1 1 =.
Load more

Recommended publications
  • Introduction to Dependence Relations and Their Links to Algebraic Hyperstructures
    mathematics Article Introduction to Dependence Relations and Their Links to Algebraic Hyperstructures Irina Cristea 1,* , Juš Kocijan 1,2 and Michal Novák 3 1 Centre for Information Technologies and Applied Mathematics, University of Nova Gorica, 5000 Nova Gorica, Slovenia; [email protected] 2 Department of Systems and Control, Jožef Stefan Institut, Jamova Cesta 39, 1000 Ljubljana, Slovenia 3 Faculty of Electrical Engineering and Communication, Brno University of Technology, Technická 10, 61600 Brno, Czech Republic; [email protected] * Correspondence: [email protected] or [email protected]; Tel.: +386-533-153-95 Received: 11 July 2019; Accepted: 19 September 2019; Published: 23 September 2019 Abstract: The aim of this paper is to study, from an algebraic point of view, the properties of interdependencies between sets of elements (i.e., pieces of secrets, atmospheric variables, etc.) that appear in various natural models, by using the algebraic hyperstructure theory. Starting from specific examples, we first define the relation of dependence and study its properties, and then, we construct various hyperoperations based on this relation. We prove that two of the associated hypergroupoids are Hv-groups, while the other two are, in some particular cases, only partial hypergroupoids. Besides, the extensivity and idempotence property are studied and related to the cyclicity. The second goal of our paper is to provide a new interpretation of the dependence relation by using elements of the theory of algebraic hyperstructures. Keywords: hyperoperation; hypergroupoid; dependence relation; influence; impact 1. Introduction In many real-life situations, there are contexts with numerous “variables”, which somehow depend on one another.
    [Show full text]
  • Categorical Comprehensions and Recursion Arxiv:1501.06889V2
    Categorical Comprehensions and Recursion Joaquín Díaz Boilsa,∗ aFacultad de Ciencias Exactas y Naturales. Pontificia Universidad Católica del Ecuador. 170150. Quito. Ecuador. Abstract A new categorical setting is defined in order to characterize the subrecursive classes belonging to complexity hierarchies. This is achieved by means of coer- cion functors over a symmetric monoidal category endowed with certain recur- sion schemes that imitate the bounded recursion scheme. This gives a categorical counterpart of generalized safe composition and safe recursion. Keywords: Symmetric Monoidal Category, Safe Recursion, Ramified Recursion. 1. Introduction Various recursive function classes have been characterized in categorical terms. It has been achieved by considering a category with certain structure endowed with a recursion scheme. The class of Primitive Recursive Functions (PR in the sequel), for instance, has been chased simply by means of a carte- sian category and a Natural Numbers Object with parameters (nno in the sequel, see [11]). In [13] it can be found a generalization of that characterization to a monoidal setting, that is achieved by endowing a monoidal category with a spe- cial kind of nno (a left nno) where the tensor product is included. It is also known that other classes containing PR can be obtained by adding more struc- ture: considering for instance a topos ([8]), a cartesian closed category ([14]) or a category with finite limits ([12]).1 Less work has been made, however, on categorical characterizations of sub- arXiv:1501.06889v2 [math.CT] 28 Jan 2015 recursive function classes, that is, those contained in PR (see [4] and [5]). In PR there is at least a sequence of functions such that every function in it has a more complex growth than the preceding function in the sequence.
    [Show full text]
  • The Notion Of" Unimaginable Numbers" in Computational Number Theory
    Beyond Knuth’s notation for “Unimaginable Numbers” within computational number theory Antonino Leonardis1 - Gianfranco d’Atri2 - Fabio Caldarola3 1 Department of Mathematics and Computer Science, University of Calabria Arcavacata di Rende, Italy e-mail: [email protected] 2 Department of Mathematics and Computer Science, University of Calabria Arcavacata di Rende, Italy 3 Department of Mathematics and Computer Science, University of Calabria Arcavacata di Rende, Italy e-mail: [email protected] Abstract Literature considers under the name unimaginable numbers any positive in- teger going beyond any physical application, with this being more of a vague description of what we are talking about rather than an actual mathemati- cal definition (it is indeed used in many sources without a proper definition). This simply means that research in this topic must always consider shortened representations, usually involving recursion, to even being able to describe such numbers. One of the most known methodologies to conceive such numbers is using hyper-operations, that is a sequence of binary functions defined recursively starting from the usual chain: addition - multiplication - exponentiation. arXiv:1901.05372v2 [cs.LO] 12 Mar 2019 The most important notations to represent such hyper-operations have been considered by Knuth, Goodstein, Ackermann and Conway as described in this work’s introduction. Within this work we will give an axiomatic setup for this topic, and then try to find on one hand other ways to represent unimaginable numbers, as well as on the other hand applications to computer science, where the algorith- mic nature of representations and the increased computation capabilities of 1 computers give the perfect field to develop further the topic, exploring some possibilities to effectively operate with such big numbers.
    [Show full text]
  • Hyperoperations and Nopt Structures
    Hyperoperations and Nopt Structures Alister Wilson Abstract (Beta version) The concept of formal power towers by analogy to formal power series is introduced. Bracketing patterns for combining hyperoperations are pictured. Nopt structures are introduced by reference to Nept structures. Briefly speaking, Nept structures are a notation that help picturing the seed(m)-Ackermann number sequence by reference to exponential function and multitudinous nestings thereof. A systematic structure is observed and described. Keywords: Large numbers, formal power towers, Nopt structures. 1 Contents i Acknowledgements 3 ii List of Figures and Tables 3 I Introduction 4 II Philosophical Considerations 5 III Bracketing patterns and hyperoperations 8 3.1 Some Examples 8 3.2 Top-down versus bottom-up 9 3.3 Bracketing patterns and binary operations 10 3.4 Bracketing patterns with exponentiation and tetration 12 3.5 Bracketing and 4 consecutive hyperoperations 15 3.6 A quick look at the start of the Grzegorczyk hierarchy 17 3.7 Reconsidering top-down and bottom-up 18 IV Nopt Structures 20 4.1 Introduction to Nept and Nopt structures 20 4.2 Defining Nopts from Nepts 21 4.3 Seed Values: “n” and “theta ) n” 24 4.4 A method for generating Nopt structures 25 4.5 Magnitude inequalities inside Nopt structures 32 V Applying Nopt Structures 33 5.1 The gi-sequence and g-subscript towers 33 5.2 Nopt structures and Conway chained arrows 35 VI Glossary 39 VII Further Reading and Weblinks 42 2 i Acknowledgements I’d like to express my gratitude to Wikipedia for supplying an enormous range of high quality mathematics articles.
    [Show full text]
  • I Jornada De Investigación Sistemas.Pdf
    ISBN: 978-9942-9902-6-6 1 1 Copyright: Dirección de Investigación de la Pontificia Universidad Católica del Ecuador Sede Esmeraldas, prohibida la reproducción total o parcial de este libro por ningún medio impreso o electrónico sin el permiso previo y por escrito del dueño del copyright. PONTIFICIA UNIVERSIDAD CATÓLICA DEL ECUADOR SEDE ESMERALDAS Dirección: Espejo y subida a Santa Cruz Casilla: 08-01-0065 Teléfonos: +593 (06) 2721983 – 2721595 Email: [email protected] www.pucese.edu.ec ESMERALDAS - ECUADOR PUBLICACIÓN ELECTRÓNICA ISBN: 978-9942-9902-6-6 Los artículos incluidos en esta publicación fueron sometidos a procedimientos de admisión y revisión por pares, llevados a cabo por un comité científico nacional e internacional de alto nivel. 2 La simulación en ingeniería, transcendiendo fronteras Coordinador de la Carrera de Sistemas y Computación Víctor Xavier Quiñonez Ku Director de Investigación PUCE Esmeraldas Ignacio Carazo Ortega Comité Organizador Víctor Xavier Quiñonez Ku Jaime Paúl Sayago Heredia Luis Alberto Herrera Izquierdo Comité Editorial Pablo Antonio Pico Valencia, Universidad de Granada – España Evelin Lorena Flores García, Universidad de Almería – España Cesar Raúl García Jacas, Universidad Nacional Autónoma de México José Luis Sampietro Saquicela, Universidad de Barcelona – España Luis Dionicio Rosales Romero, Universidad de los Andes – Venezuela Juan Luis Casierra Cavada, Pontificia Universidad Católica del Ecuador Pedro Roberto Suarez Suri, Pontificia Universidad Católica del Ecuador Víctor Xavier Quiñonez
    [Show full text]
  • An Introduction to Ramsey Theory Fast Functions, Infinity, and Metamathematics
    STUDENT MATHEMATICAL LIBRARY Volume 87 An Introduction to Ramsey Theory Fast Functions, Infinity, and Metamathematics Matthew Katz Jan Reimann Mathematics Advanced Study Semesters 10.1090/stml/087 An Introduction to Ramsey Theory STUDENT MATHEMATICAL LIBRARY Volume 87 An Introduction to Ramsey Theory Fast Functions, Infinity, and Metamathematics Matthew Katz Jan Reimann Mathematics Advanced Study Semesters Editorial Board Satyan L. Devadoss John Stillwell (Chair) Rosa Orellana Serge Tabachnikov 2010 Mathematics Subject Classification. Primary 05D10, 03-01, 03E10, 03B10, 03B25, 03D20, 03H15. Jan Reimann was partially supported by NSF Grant DMS-1201263. For additional information and updates on this book, visit www.ams.org/bookpages/stml-87 Library of Congress Cataloging-in-Publication Data Names: Katz, Matthew, 1986– author. | Reimann, Jan, 1971– author. | Pennsylvania State University. Mathematics Advanced Study Semesters. Title: An introduction to Ramsey theory: Fast functions, infinity, and metamathemat- ics / Matthew Katz, Jan Reimann. Description: Providence, Rhode Island: American Mathematical Society, [2018] | Series: Student mathematical library; 87 | “Mathematics Advanced Study Semesters.” | Includes bibliographical references and index. Identifiers: LCCN 2018024651 | ISBN 9781470442903 (alk. paper) Subjects: LCSH: Ramsey theory. | Combinatorial analysis. | AMS: Combinatorics – Extremal combinatorics – Ramsey theory. msc | Mathematical logic and foundations – Instructional exposition (textbooks, tutorial papers, etc.). msc | Mathematical
    [Show full text]
  • A Survey of Recursive Analysis and Moore's Notion of Real Computation
    A Survey of Recursive Analysis and Moore’s Notion of Real Computation Walid Gomaa INRIA Nancy Grand-Est Research Centre, France, Faculty of Engineering, Alexandria University, Egypt [email protected] Abstract The theory of analog computation aims at modeling computational systems that evolve in a continuous manner. Unlike the situation with the discrete setting there is no unified theory of analog computation. There are several proposed theories, some of them seem quite orthogonal. Some theories can be considered as generalizations of the Turing machine theory and classical recursion theory. Among such are recursive analysis and Moore’s class of recursive real functions. Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. Real computation in this context is viewed as effective (in the sense of Turing machine theory) convergence of sequences of rational numbers. In 1996 Moore introduced a function algebra that captures his notion of real computation; it consists of some basic functions and their closure under composition, integration and zero- finding. Though this class is inherently unphysical, much work have been directed at stratifying, restricting, and comparing it with other theories of real computation such as recursive analysis and the GPAC. In this article we give a detailed exposition of recursive analysis and Moore’s class and the relationships between them. 1 Introduction Analog computation is a computational paradigm that attempts to model systems whose internal states are continuous rather than discrete. Unlike the case of discrete computation, which has enjoyed a kind of uniformity and conceptual universality, there have been several approaches to analog computations some of which are not even comparable.
    [Show full text]
  • 0.1 Axt, Loop Program, and Grzegorczyk Hier- Archies
    1 0.1 Axt, Loop Program, and Grzegorczyk Hier- archies Computable functions can have some quite complex definitions. For example, a loop programmable function might be given via a loop program that has depth of nesting of the loop-end pair, say, equal to 200. Now this is complex! Or a function might be given via an arbitrarily complex sequence of primitive recursions, with the restriction that the computed function is majorized by some known function, for all values of the input (for the concept of majorization see Subsection on the Ackermann function.). But does such definitional|and therefore, \static"|complexity have any bearing on the computational|dynamic|complexity of the function? We will see that it does, and we will connect definitional and computational complexities quantitatively. Our study will be restricted to the class PR that we will subdivide into an infinite sequence of increasingly more inclusive subclasses, Si. A so-called hierarchy of classes of functions. 0.1.0.1 Definition. A sequence (Si)i≥0 of subsets of PR is a primitive recur- sive hierarchy provided all of the following hold: (1) Si ⊆ Si+1, for all i ≥ 0 S (2) PR = i≥0 Si. The hierarchy is proper or nontrivial iff Si 6= Si+1, for all but finitely many i. If f 2 Si then we say that its level in the hierarchy is ≤ i. If f 2 Si+1 − Si, then its level is equal to i + 1. The first hierarchy that we will define is due to Axt and Heinermann [[5] and [1]].
    [Show full text]
  • New Thinking About Math Infinity by Alister “Mike Smith” Wilson
    New thinking about math infinity by Alister “Mike Smith” Wilson (My understanding about some historical ideas in math infinity and my contributions to the subject) For basic hyperoperation awareness, try to work out 3^^3, 3^^^3, 3^^^^3 to get some intuition about the patterns I’ll be discussing below. Also, if you understand Graham’s number construction that can help as well. However, this paper is mostly philosophical. So far as I am aware I am the first to define Nopt structures. Maybe there are several reasons for this: (1) Recursive structures can be defined by computer programs, functional powers and related fast-growing hierarchies, recurrence relations and transfinite ordinal numbers. (2) There has up to now, been no call for a geometric representation of numbers related to the Ackermann numbers. The idea of Minimal Symbolic Notation and using MSN as a sequential abstract data type, each term derived from previous terms is a new idea. Summarising my work, I can outline some of the new ideas: (1) Mixed hyperoperation numbers form interesting pattern numbers. (2) I described a new method (butdj) for coloring Catalan number trees the butdj coloring method has standard tree-representation and an original block-diagram visualisation method. (3) I gave two, original, complicated formulae for the first couple of non-trivial terms of the well-known standard FGH (fast-growing hierarchy). (4) I gave a new method (CSD) for representing these kinds of complicated formulae and clarified some technical difficulties with the standard FGH with the help of CSD notation. (5) I discovered and described a “substitution paradox” that occurs in natural examples from the FGH, and an appropriate resolution to the paradox.
    [Show full text]
  • Hierarchies of Recursive Functions
    Leibniz Universitat¨ Hannover Institut f¨urtheoretische Informatik Bachelor Thesis Hierarchies of recursive functions Maurice Chandoo February 21, 2013 Erkl¨arung Hiermit versichere ich, dass ich diese Arbeit selbst¨andigverfasst habe und keine anderen als die angegebenen Quellen und Hilfsmittel verwendet habe. i Dedicated to my dear grandmother Anna-Maria Kniejska ii Contents 1 Preface 1 2 Class of primitve recursive functions PR 2 2.1 Primitive Recursion class PR ..................2 2.2 Course-of-value Recursion class PRcov .............4 2.3 Nested Recursion class PRnes ..................5 2.4 Recursive Depth . .6 2.5 Recursive Relations . .6 2.6 Equivalence of PR and PRcov .................. 10 2.7 Equivalence of PR and PRnes .................. 12 2.8 Loop programs . 14 2.9 Grzegorczyk Hierarchy . 19 2.10 Recursive depth Hierarchy . 22 2.11 Turing Machine Simulation . 24 3 Multiple and µ-recursion 27 3.1 Multiple Recursion class MR .................. 27 3.2 µ-Recursion class µR ....................... 32 3.3 Synopsis . 34 List of literature 35 iii 1 Preface I would like to give a more or less exhaustive overview on different kinds of recursive functions and hierarchies which characterize these functions by their computational power. For instance, it will become apparent that primitve recursion is more than sufficiently powerful for expressing algorithms for the majority of known decidable ”real world” problems. This comes along with the hunch that it is quite difficult to come up with a suitable problem of which the characteristic function is not primitive recursive therefore being a possible candidate for exploiting the more powerful multiple recursion. At the end the Turing complete µ-recursion is introduced.
    [Show full text]
  • The Strange Properties of the Infinite Power Tower Arxiv:1908.05559V1
    The strange properties of the infinite power tower An \investigative math" approach for young students Luca Moroni∗ (August 2019) Nevertheless, the fact is that there is nothing as dreamy and poetic, nothing as radical, subversive, and psychedelic, as mathematics. Paul Lockhart { \A Mathematician's Lament" Abstract In this article we investigate some "unexpected" properties of the \Infinite Power Tower 1" function (or \Tetration with infinite height"): . .. xx y = f(x) = xx where the \tower" of exponentiations has an infinite height. Apart from following an initial personal curiosity, the material collected here is also intended as a potential guide for teachers of high-school/undergraduate students interested in planning an activity of \investigative mathematics in the classroom", where the knowledge is gained through the active, creative and cooperative use of diversified mathematical tools (and some ingenuity). The activity should possibly be carried on with a laboratorial style, with no preclusions on the paths chosen and undertaken by the students and with little or no information imparted from the teacher's desk. The teacher should then act just as a guide and a facilitator. The infinite power tower proves to be particularly well suited to this kind of learning activity, as the student will have to face a challenging function defined through a rather uncommon infinite recursive process. They'll then have to find the right strategies to get around the trickiness of this function and achieve some concrete results, without the help of pre-defined procedures. The mathematical requisites to follow this path are: functions, properties of exponentials and logarithms, sequences, limits and derivatives.
    [Show full text]
  • Symmetry in Classical and Fuzzy Algebraic Hypercompositional Structures • Irina Cristea Symmetry in Classical and Fuzzy Algebraic Hypercompositional Structures
    Symmetry Classical Algebraic Fuzzy in and Hypercompositional Structures Symmetry in Classical • Irina Cristea and Fuzzy Algebraic Hypercompositional Structures Edited by Irina Cristea Printed Edition of the Special Issue Published in Symmetry www.mdpi.com/journal/symmetry Symmetry in Classical and Fuzzy Algebraic Hypercompositional Structures Symmetry in Classical and Fuzzy Algebraic Hypercompositional Structures Special Issue Editor Irina Cristea MDPI • Basel • Beijing • Wuhan • Barcelona • Belgrade • Manchester • Tokyo • Cluj • Tianjin Special Issue Editor Irina Cristea Center for Information Technologies and Applied Mathematics, University of Nova Gorica Slovenia Editorial Office MDPI St. Alban-Anlage 66 4052 Basel, Switzerland This is a reprint of articles from the Special Issue published online in the open access journal Symmetry (ISSN 2073-8994) (available at: https://www.mdpi.com/journal/symmetry/special issues/Fuzzy Algebraic Hypercompositional Structures). For citation purposes, cite each article independently as indicated on the article page online and as indicated below: LastName, A.A.; LastName, B.B.; LastName, C.C. Article Title. Journal Name Year, Article Number, Page Range. ISBN 978-3-03928-708-6 (Pbk) ISBN 978-3-03928-709-3 (PDF) c 2020 by the authors. Articles in this book are Open Access and distributed under the Creative Commons Attribution (CC BY) license, which allows users to download, copy and build upon published articles, as long as the author and publisher are properly credited, which ensures maximum dissemination and a wider impact of our publications. The book as a whole is distributed by MDPI under the terms and conditions of the Creative Commons license CC BY-NC-ND. Contents About the Special Issue Editor .....................................
    [Show full text]