Top definition
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.
xkcd's number calls the Ackermann function with Graham's Number as both of its parameters.
by Ἀπολλύων September 17, 2016
Apr 25 Word of the Day
v. collectively or individually finding someone/something to blame for a problem, as opposed to brainstorming which connotes finding solutions to a problem
n. the act of finding someone/something to blame for a problem
(from a TV ad for HD television)
n. the act of finding someone/something to blame for a problem
(from a TV ad for HD television)
The committee commenced blamestorming over the situation rather than seeking solutions to the problem.
by TBea April 22, 2008