For any finite set of argument/function pairs, an algorithm can be automatically constructed which, on presentation of any argument, will generate its proper function value. Arguments are necessarily unique although functions may be duplicated; i.e. a many-to-one relationship is permitted. For purposes of illustration here, function and argument values are each assumed to occupy a single computer word.
The Latest from CACM
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get InvolvedCommunications of the ACM (CACM) is now a fully Open Access publication.
By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More
Join the Discussion (0)
Become a Member or Sign In to Post a Comment