• the Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a total computable function that is...
    51 KB (6,781 words) - 01:48, 28 June 2024
  • Thumbnail for Wilhelm Ackermann
    work in mathematical logic and the Ackermann function, an important example in the theory of computation. Ackermann was born in Herscheid, Germany, and...
    5 KB (425 words) - 09:22, 11 March 2024
  • recursive functions. However, not every total recursive function is a primitive recursive function—the most famous example is the Ackermann function. Other...
    18 KB (2,748 words) - 14:59, 24 June 2023
  • grows phenomenally fast as a function of n, far faster than any primitive recursive function or the Ackermann function, for example.[citation needed]...
    14 KB (1,785 words) - 06:47, 14 July 2024
  • same function within a definition be to arguments that are smaller in some well-partial-order on the function's domain. For instance, for the Ackermann function...
    24 KB (3,393 words) - 20:54, 17 July 2024
  • 3=g_{3}(2)=g_{2}^{2}(1)=g_{2}(g_{2}(1))=f^{f(1)}(1)=f^{a^{b}}(1)} The Ackermann function can be expressed using Conway chained arrow notation: A ( m , n )...
    15 KB (3,068 words) - 14:26, 9 July 2024
  • total time O(mα(n)), where α(n) is the extremely slow-growing inverse Ackermann function. Disjoint-set forests do not guarantee this performance on a per-operation...
    33 KB (4,617 words) - 21:17, 12 May 2024
  • Wilhelm Ackermann Ackermann function Ackermann ordinal Ackermann set theory Ackermann steering geometry, in mechanical engineering Ackermann's formula...
    745 bytes (113 words) - 04:48, 8 February 2021
  • Thumbnail for Double exponential function
    faster than exponential functions, but much more slowly than double exponential functions. However, tetration and the Ackermann function grow faster. See Big...
    9 KB (1,118 words) - 02:38, 22 February 2024
  • Lamé function Mathieu function Mittag-Leffler function Painlevé transcendents Parabolic cylinder function Arithmetic–geometric mean Ackermann function: in...
    10 KB (1,064 words) - 22:54, 8 July 2024
  • primitive recursive function is total recursive, but not all total recursive functions are primitive recursive. The Ackermann function A(m,n) is a well-known...
    37 KB (7,078 words) - 09:42, 23 June 2024
  • Sudan function is an example of a function that is recursive, but not primitive recursive. This is also true of the better-known Ackermann function. In...
    17 KB (557 words) - 09:11, 19 February 2024
  • Thumbnail for Tetration
    Wikimedia Commons has media related to tetration. Ackermann function Big O notation Double exponential function Hyperoperation Iterated logarithm Symmetric...
    52 KB (6,039 words) - 21:40, 13 July 2024
  • rule part of the definition, as in Knuth's up-arrow version of the Ackermann function: a [ n ] b = a [ n − 1 ] ( a [ n ] ( b − 1 ) ) , n ≥ 1 {\displaystyle...
    43 KB (5,778 words) - 06:07, 31 May 2024
  • Turing-complete language and can express all computable functions. For example, it can express the Ackermann function, which (not being primitive recursive) cannot...
    6 KB (697 words) - 12:49, 12 October 2023
  • Thumbnail for Busy beaver
    recursive function that computes their score (computes σ), thus providing a lower bound for Σ. This function's growth is comparable to that of Ackermann's function...
    57 KB (7,077 words) - 22:48, 17 July 2024
  • ISBN 978-3-319-68397-3. Halmos, Chapter 11 Rubtsov, C.A.; Romerio, G.F. (2004). "Ackermann's Function and New Arithmetical Operations" (PDF). Paul R. Halmos (1968). Naive...
    3 KB (389 words) - 13:27, 27 March 2024
  • the Ackermann function. Raphael M. Robinson called functions of two natural number variables G(n, x) double recursive with respect to given functions, if...
    2 KB (189 words) - 22:05, 18 January 2024
  • Fast-growing hierarchy (category Hierarchy of functions)
    recursive function is dominated by fω, which is a variant of the Ackermann function. For n ≥ 3, the set E n {\displaystyle {\mathcal {E}}^{n}} in the...
    13 KB (1,561 words) - 11:16, 24 February 2024
  • Thumbnail for Kruskal's algorithm
    α(V)) for this loop, where α is the extremely slowly growing inverse Ackermann function. This part of the time bound is much smaller than the time for the...
    16 KB (1,851 words) - 21:25, 27 April 2024
  • Thumbnail for Pentation
    the pentation function may also be obtained from the values in the fourth row of the table of values of a variant of the Ackermann function: if A ( n ,...
    9 KB (1,759 words) - 04:06, 18 May 2024
  • increasing) function; in particular, Ackermann function. Simple function: a real-valued function over a subset of the real line, similar to a step function. Measurable...
    13 KB (1,407 words) - 21:21, 26 January 2023
  • Thumbnail for Gabriel Sudan
    mathematician, known for the Sudan function, an important example in the theory of computation, similar to the Ackermann function. Born in Bucharest, Sudan received...
    3 KB (244 words) - 19:50, 12 January 2023
  • enormously large – bounds that grow exponentially, or even as fast as the Ackermann function are not uncommon. In some small niche cases, upper and lower bounds...
    9 KB (1,139 words) - 01:54, 19 August 2023
  • Thumbnail for Iterated logarithm
    {\displaystyle n{\sqrt {\log ^{*}n}}.} Inverse Ackermann function, an even more slowly growing function also used in computational complexity theory Cormen...
    7 KB (746 words) - 02:59, 30 June 2024
  • mathematical functions, the analysis of some puzzles and games, and some pathological examples which can be modelled as the Ackermann function. A Latin square...
    11 KB (1,227 words) - 15:39, 6 July 2024
  • recursive functions such as the Ackermann function. It dominates every computable function provably total in Peano arithmetic, which includes functions such...
    5 KB (648 words) - 20:33, 31 May 2024
  • by a function involving the first four hyperoperators;. Then, f ω ( x ) {\displaystyle f_{\omega }(x)} is comparable to the Ackermann function, f ω +...
    28 KB (3,390 words) - 19:42, 12 May 2024
  • Thumbnail for Recursion (computer science)
    include divide-and-conquer algorithms such as Quicksort, and functions such as the Ackermann function. All of these algorithms can be implemented iteratively...
    60 KB (7,257 words) - 20:06, 21 April 2024
  • extremely large numbers: Knuth's up-arrow notation/hyperoperators/Ackermann function, including tetration Conway chained arrow notation Steinhaus-Moser...
    44 KB (7,098 words) - 06:49, 4 July 2024