High Quality Content by WIKIPEDIA articles! The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions (recursive functions are also known as computable functions). The term was coined by Rozsa Peter. In computability theory, primitive recursive functions are a class of functions which form an important building block on the way to a full formalization of computability. These functions are also important in proof theory.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.