Primitive recursive functions are a subset of general recursive functions that can be computed by computer programs with "for" loops. They are important in number theory and mathematics as many computable functions fall into this category. The set of primitive recursive functions is denoted as PR in computational complexity theory.
Carnegie Mellon University
Spring 2021
This advanced course reexamines traditional concepts of discrete mathematics (relations, functions, logic, graphs, algebra, automata) in the context of computation and algorithms, necessitating a strong background in discrete math.
No concepts data
+ 23 more concepts