Ackermann function
id:
ackermann-function-168-13314097
title:
Ackermann function
text:
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 computable, but the Ackermann function illustrates that not all total computable functions are primitive recursive. After Ackermann's publication of his function, many authors modified it to suit various purposes, so that today "the Ackermann function"
brand slug:
wiki
category slug:
encyclopedia
description:
Quickly-growing function
original url:
https://en.wikipedia.org/wiki/Ackermann_function
date created:
2001-12-15T19:21:13Z
date modified:
2024-08-31T02:33:22Z
main entity:
{"identifier":"Q341835","url":"https://www.wikidata.org/entity/Q341835"}
image:
fields total:
13
integrity:
15