Abstract
This paper deals with how associative algorithms can be easily formulated and expressed in a flexible associative language, Pascal/A, which is an extension of standard Pascal. The power of associative processing is delineated with the help of a few examples. Further, the simulation of an associative machine using Pascal/A is also discussed, with a broad overview of the issues involved in the efficiency of such an implementation.
Sign-in/Register to access full text options 
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 callSimilar Papers
Disclaimer: 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.
