Andere Kunden interessierten sich auch für
![Primitive Recursive Function]( "Primitive Recursive Function")
Primitive Recursive Function25,99 €![Primitive Recursive Arithmetic]( "Primitive Recursive Arithmetic")
Primitive Recursive Arithmetic25,99 €![Primitive Recursive Arithmetic]( "Primitive Recursive Arithmetic")
Primitive Recursive Arithmetic25,99 €![Recursive Languages and Sets]( "Recursive Languages and Sets")
Recursive Languages and Sets32,99 €![Primitive Equations]( "Primitive Equations")
Primitive Equations25,99 €![Primitive Root Modulo N]( "Primitive Root Modulo N")
Primitive Root Modulo N19,99 €![Primitive Equations]( "Primitive Equations")
Primitive Equations25,99 €
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 Rózsa Péter. 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.