In computability theory, the Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a total computable function that is not primitive recursive. All primitive recursive functions are total and ...

In computer science, bogosort (also stupid sort, slowsort, random sort, shotgun sort or monkey sort ) is a particularly ineffective sorting algorithm based on the generate and test paradigm. It is not useful for sorting, but may be used for ...

In mathematics, the Fibonacci numbers or Fibonacci sequence are the numbers in the following integer sequence :
or (often, in modern usage):
By definition, the first two numbers in the Fibonacci sequence are either 1 and 1, or 0 and 1, depending ...