A generalized method for generating argument/function values

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

A generalized method for generating argument/function values

Full text

Pdf (140 KB)

Source

Communications of the ACM archive
Volume 13 , Issue 11 (November 1970) table of contents

Pages: 696 - 697

Year of Publication: 1970

ISSN:0001-0782

Author

William J. Wilson

Federal Systems Division, Huntsville, AL

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 10, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/362790.362806 What is a DOI?

ABSTRACT

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

Peter. Wegner, Programming Languages, Information Structures, and Machine Organization., McGraw Hill Text, 1968

INDEX TERMS

Keywords:
decision hierarchy, mapping function, table look-up

Collaborative Colleagues:

William J. Wilson: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player