Ackermann function

English

Etymology

Named after Wilhelm Ackermann.

Proper noun

Ackermann function

  1. (computing theory) One of the simplest and earliest examples of a total computable function that is not primitive recursive.

Translations

This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.