1.Previous
3.Next

operator (also called the substitution operator): Given an m-ary function and m k-ary functions :
#::
#:This means that is defined only if and are all defined.
# Primitive recursion operator : Given the k-ary function and k+2 -ary function :
#::
#:This means that is defined only if and are defined for all
#Minimization operator : Given a (k+1)-ary function , the k-ary function is defined by:
#::Intuitively, minimisation seeks--beginning the search from 0 and proceeding upwards--the smallest argument

1.Previous
3.Next