mathworld.wolfram.com/AckermannFunction.html

Preview meta tags from the mathworld.wolfram.com website.

Linked Hostnames

8

Thumbnail

Search Engine Appearance

Google

https://mathworld.wolfram.com/AckermannFunction.html

Ackermann Function -- from Wolfram MathWorld

The Ackermann function is the simplest example of a well-defined total function which is computable but not primitive recursive, providing a counterexample to the belief in the early 1900s that every computable function was also primitive recursive (Dötzel 1991). It grows faster than an exponential function, or even a multiple exponential function. The Ackermann function A(x,y) is defined for integer x and y by A(x,y)={y+1 if x=0; A(x-1,1) if y=0; A(x-1,A(x,y-1)) otherwise. (1) ...



Bing

Ackermann Function -- from Wolfram MathWorld

https://mathworld.wolfram.com/AckermannFunction.html

The Ackermann function is the simplest example of a well-defined total function which is computable but not primitive recursive, providing a counterexample to the belief in the early 1900s that every computable function was also primitive recursive (Dötzel 1991). It grows faster than an exponential function, or even a multiple exponential function. The Ackermann function A(x,y) is defined for integer x and y by A(x,y)={y+1 if x=0; A(x-1,1) if y=0; A(x-1,A(x,y-1)) otherwise. (1) ...



DuckDuckGo

https://mathworld.wolfram.com/AckermannFunction.html

Ackermann Function -- from Wolfram MathWorld

The Ackermann function is the simplest example of a well-defined total function which is computable but not primitive recursive, providing a counterexample to the belief in the early 1900s that every computable function was also primitive recursive (Dötzel 1991). It grows faster than an exponential function, or even a multiple exponential function. The Ackermann function A(x,y) is defined for integer x and y by A(x,y)={y+1 if x=0; A(x-1,1) if y=0; A(x-1,A(x,y-1)) otherwise. (1) ...

  • General Meta Tags

    19
    • title
      Ackermann Function -- from Wolfram MathWorld
    • DC.Title
      Ackermann Function
    • DC.Creator
      Weisstein, Eric W.
    • DC.Description
      The Ackermann function is the simplest example of a well-defined total function which is computable but not primitive recursive, providing a counterexample to the belief in the early 1900s that every computable function was also primitive recursive (Dötzel 1991). It grows faster than an exponential function, or even a multiple exponential function. The Ackermann function A(x,y) is defined for integer x and y by A(x,y)={y+1 if x=0; A(x-1,1) if y=0; A(x-1,A(x,y-1)) otherwise. (1) ...
    • description
      The Ackermann function is the simplest example of a well-defined total function which is computable but not primitive recursive, providing a counterexample to the belief in the early 1900s that every computable function was also primitive recursive (Dötzel 1991). It grows faster than an exponential function, or even a multiple exponential function. The Ackermann function A(x,y) is defined for integer x and y by A(x,y)={y+1 if x=0; A(x-1,1) if y=0; A(x-1,A(x,y-1)) otherwise. (1) ...

  • Open Graph Meta Tags

    5
    • og:image
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_AckermannFunction.png
    • og:url
      https://mathworld.wolfram.com/AckermannFunction.html
    • og:type
      website
    • og:title
      Ackermann Function -- from Wolfram MathWorld
    • og:description
      The Ackermann function is the simplest example of a well-defined total function which is computable but not primitive recursive, providing a counterexample to the belief in the early 1900s that every computable function was also primitive recursive (Dötzel 1991). It grows faster than an exponential function, or even a multiple exponential function. The Ackermann function A(x,y) is defined for integer x and y by A(x,y)={y+1 if x=0; A(x-1,1) if y=0; A(x-1,A(x,y-1)) otherwise. (1) ...

  • Twitter Meta Tags

    5
    • twitter:card
      summary_large_image
    • twitter:site
      @WolframResearch
    • twitter:title
      Ackermann Function -- from Wolfram MathWorld
    • twitter:description
      The Ackermann function is the simplest example of a well-defined total function which is computable but not primitive recursive, providing a counterexample to the belief in the early 1900s that every computable function was also primitive recursive (Dötzel 1991). It grows faster than an exponential function, or even a multiple exponential function. The Ackermann function A(x,y) is defined for integer x and y by A(x,y)={y+1 if x=0; A(x-1,1) if y=0; A(x-1,A(x,y-1)) otherwise. (1) ...
    • twitter:image:src
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_AckermannFunction.png

  • Link Tags

    4
    • canonical
      https://mathworld.wolfram.com/AckermannFunction.html
    • preload
      //www.wolframcdn.com/fonts/source-sans-pro/1.0/global.css
    • stylesheet
      /css/styles.css
    • stylesheet
      /common/js/c2c/1.0/WolframC2CGui.css.en

Links

54