Abstract
This chapter discusses a language for combinatorial computing. A combinatorial language is a statement language, that is, a program for performing a certain task that consists of a sequence of statements describing the calculation that is to take place. It happens frequently in combinatorial computing that more than one computer word is required to represent the monstrous integers obtained during a calculation. The chapter discusses the three basic data-types: real numbers, unordered sets of natural numbers, and arrays whose entries are either real numbers or sets of natural numbers. Finite sets of natural numbers, one of the basic data-types recognized in the language play a fundamental role in combinatorial computing. The notation adopted for the manipulation of such data is essentially conventional mathematical notation, although certain symbolism and its associated data handling do suggest computer orientation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
