ackermann function



in the computational sciences, the ackermann function (represented as a(m,n) is the simplest example of a total function (a function defined for all possible input values) which is computable but not primitive recursive, which was originally formulated to disprove the once-common belief that every computable function was also primitive recursive, but is now used to generate absurdly large numbers to horrify mathematicians.
calling the ackermann function with (4, 4) as its parameters is already too large to calculate for most computers.

xkcd’s number calls the ackermann function with graham’s number as both of its parameters.

Read Also:

  • randy munyon

    a f-ggot dude1: look at that randy munyon over there! dude2: dude randy munyon is a f-ggot!

  • fgbu

    f-cks given by us in response to something drole and overwhelmingly boring on a chat channel, someone might respond on behalf of the group “fgbu”

  • alex cupstid

    the most perfect adorable amazing best cutest funniest most talented brillanted squishiest fluffiest and many more to describe this man he is very love able and has many things that make him unique and he’s the best there is 😍😍 you’re so perfect omg he’s alex cupstid

  • michael collins lonely

    used to refer to extreme levels of loneliness. michael collins the astronaut. he was one of the three persons aboard on apollo 11 crew. the other two neil armstrong and buzz aldrin got to walk on the moon, whilst michael collins was sitting in the command module alone. in fact, for 45 minutes, when he […]

  • salty neck slap

    when your hand is sweaty and you proceed to slap someone on the throat . ayye bish, you finna get salty neck slapped?


Disclaimer: ackermann function definition / meaning should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional. All content on this website is for informational purposes only.