Skip to main content

A molecular quasi-random model of computations applied to evaluate collective intelligence

  • Workshop on Biologically Inspired Solutions to Parallel Processing Problems Albert Y. Zomaya, The University of Western Australia Fikret Ercal, University of Missouri-Rolla Stephan Olariu, Old Dominion Univesity
  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1388))

Included in the following conference series:

  • 105 Accesses

Abstract

The paper presents how the Random PROLOG Processor (RPP), a bio-inspired model of computations, can be used for formalization and analysis of a phenomenon — the Collective Intelligence (CI) of social structures. The RPP originates from the question of why inference processes are quasi-chaotic in real life. In the RPP, clause-molecules (CMs) move quasi-randomly around in abstract Computational_PROLOG_Space(CS). CMs can carry clauses of facts, rules, and goals, or CMs can even be moving sets of facts, rules, and goals enclosed by membranes. When CMs rendezvous, an inference process can occur iff the prerequisite logical conditions are fulfilled. The RPP can be considered an implementation proposal of the NonDetenninistic Turing Machine. With the RPP, Cl can be evaluated as follows: l) the mapping is done of a given social structure into the structured computational space of the RPP; 2) beings and their behavior are translated into PROLOG expressions, carried by CMs; 3) the global or temporary goal(s) of the social structure (of ants, humans, etc.) are translated into an N-step inference (NSI); 4) on this basis, the efficiency of the NSI will be evaluated and given as the Intelligence Quotient of a Social Structure (IQS) projected onto NSI. The concept of IQS can be mathematically developed or used for practical evaluation of a given social structure.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

  1. —— ANT COLONY OPTIMIZATION. Homepage managed by Marco Dorigo, at location http://iridia.ulb.ac.be/dorigo/ACO/ACO.html#Bib

    Google Scholar 

  2. Adleman L. M.: Molecular computations of solutions to combinatorial problems. Science Nov. 11. 1994.

    Google Scholar 

  3. Berry G., Boudol G.: The chemical abstract machine. Theoretical Computer Science. 1992. p. 217–248.

    Google Scholar 

  4. Deneuborg J.L. et al: The Dynamics of Collective Sorting, Robot-like Ants, Ants-like Robots. From Animals to Animals, MIT Press, 1991.

    Google Scholar 

  5. Dorigo M., Maniezzo V., Colorni A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Trans. on SMB-Part B, (1996), 26, l, 29–41

    Google Scholar 

  6. Dorigo M., Gambardella L.M.: Ant Colonies... BioSystems, 1997.

    Google Scholar 

  7. Fontana W., Buss L. W.: The arrival of the fittest. Bull. Math. Biol. 56, 1994

    Google Scholar 

  8. Giarratano J., Riley G.: Expert Systems. PWS Pub. II ed. 1994.

    Google Scholar 

  9. —— Multi-Agent Simulation of Honey Bee Colonies. Homepage: http://www.ma.umist.ac.uk/dsumpter/beesim/Simulation/overview.html

    Google Scholar 

  10. Kogge P. M.: The architectures of symbolic computers. McGraw Hill. 1991.

    Google Scholar 

  11. Michalewicz Z.: GA + data structures = evolution programs. Springer 1992.

    Google Scholar 

  12. Reif J. H.: Parallel molecular computation — models and simulations. http://www/cs.duke.edu/-reif/paper/paper.html

    Google Scholar 

  13. Shaw M. E.: Group Dynamics. IV ed. McGraw-Hill 1971.

    Google Scholar 

  14. Szuba T., Stras R.: Parallel evolutionary computing with the Random PROLOG Processor. J. on Parallel and Distributed Computing. (early 1998).

    Google Scholar 

  15. Szuba T.: Evaluation measures for the collective intelligence of closed social structures. ISAS'97 Gaithersburg/Washington D.C. 22-25 Sept. 1997. *** DIRECT SUPPORT *** A0008D07 00009

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Szuba, T. (1998). A molecular quasi-random model of computations applied to evaluate collective intelligence. In: Rolim, J. (eds) Parallel and Distributed Processing. IPPS 1998. Lecture Notes in Computer Science, vol 1388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64359-1_694

Download citation

  • DOI: https://doi.org/10.1007/3-540-64359-1_694

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64359-3

  • Online ISBN: 978-3-540-69756-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics