Selected aspects of the calculus of self-modifiable algorithms theory

  • Eugeniusz Eberbach
Theory Of Computing, Algorithms And Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 468)


In this paper the introductory concepts and chosen applications of the Calculus of Self-modifiable Algorithms (CSA) are presented. The CSA model is a theory for describing parallel behavior. In contrast to the well-known Hoare's CSP and Milner's CCS parallel computing theories, the CSA model was designed as a theory within Artificial Intelligence. It considers self-modifiable algorithms which are mathematical models of processes with the possibility of applying modifications to their own behavior. The CSA model unifies artificial intelligence methods and parallelism, two fundamental aspects of new generation computers. The most important features of the CSA model are the self-modifiability of programs (changeability of code) and the optimization of control (minimizing cost of algorithm execution).


self-modifiable algorithm foundation of AI computation models fixed-point semantics parallel programming languages and methodologies 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Dijkstra E. W.: Guarded commands, nondeterminacy and formal derivation of programs; Comm. ACM, 18, 8 (1975), 453–457.Google Scholar
  2. [2]
    Eberbach E.: Algorithms with Possibilities of Selflearning and Selfmodification; Fundamenta Informaticae 6, 1 (1983), 1–44.Google Scholar
  3. [3]
    Eberbach E., Just J. R.: On Fault-Tolerance Mechanisms in Distributed Computer Systems; Microprocessing and Microprogramming 16, (1985), 239–244.Google Scholar
  4. [4]
    Eberbach E.: A Cost-Driven Machine:Fault-Tolerance and Learning; AMSE Review, 6, 2, (1987), 37–47.Google Scholar
  5. [5]
    Eberbach E.: Self-Modifiable Algorithms and Their Applications; Research Note RN/88/27, Department of Computer Science, University College London, (June 1988).Google Scholar
  6. [6]
    Eberbach E.: Self-Modifiable Algorithms: Towards a Theory of Artificial Intelligence; Proc. Intern. Conf. on Computing and Information ICCI'89, Toronto, Canada, vol.II, 1989, 261–266.Google Scholar
  7. [7]
    Eberbach E.: Formal Semantics for PARLE — a Target Machine Language of the ESPRIT SPAN Project; Tech.Rep. SPAN-WP1-26, University College London, (Jan 1989).Google Scholar
  8. [8]
    Eberbach E.: Formal Semantics and Laws of Programming for IIR — an Idealised Intermediate Representation; Tech.Rep. SPAN-WP1-28, University College London, (June 1989).Google Scholar
  9. [9]
    Eberbach E., Just J.R., Koczkodaj W.W.: An Approach to Optimal Reconfiguration Strategies for Fault-Tolerant Multiprocessor Systems; Advances in Modelling and Simulation, vol.20, no.1, (1990), 39–47.Google Scholar
  10. [10]
    Goldberg A,Robson D.: SMALLTALK-80:The language and its implementation; Addison-Wesley, 1983.Google Scholar
  11. [11]
    Hayes-Roth F., Waterman D.A., Lenat D.B.: Building Expert Systems; Addison-Wesley, 1983.Google Scholar
  12. [12]
    Hoare C. A. R.: Communicating Sequential Processes; Prentice-Hall, 1985.Google Scholar
  13. [13]
    INMOS Ltd: The OCCAM programming manual; Prentice Hall, 1984.Google Scholar
  14. [14]
    Kohonen T.: An introduction to neural computing; Neural Networks 1, 1 (1988), 3–16.Google Scholar
  15. [15]
    Lenat D.B., Brown J.S.: Why AM and EURISKO appear to work; Artificial Intelligence 23, (1984), 269–294.Google Scholar
  16. [16]
    Michalski R.S., Carbonell J.G., Mitchell T.M.: Machine Learning.An Artificial Intelligence Approach; Tioga, Palo Alto, 1983.Google Scholar
  17. [17]
    Minsky M.: A framework for representing knowledge; In: Winston, P. (ed) The psychology of computer vision, McGraw-Hill, New York, 1975.Google Scholar
  18. [18]
    Pawlak Z.: Information systems-theoretical foundations; Information Systems 6, 3 (1981), 205–218.Google Scholar
  19. [19]
    Petri C.A.: Kommunikation mit Automaten; Schriftung des Rheinisch-Westfalischen Institutes fur Instrumentelle Mathematik an der Universitat Bonn, Heft 2, Bonn, 1962.Google Scholar
  20. [20]
    Refenes A. N., Clough J. R., McCabe S. C., and Treleaven P. C.: SPAN: Parallel Computer Systems for Integrated Symbolic and Numeric Processing; Proc. ESPRIT'88 Conf. Putting the Technology to Use, North-Holland, vol.I, Brussels (1988), 877–890.Google Scholar
  21. [21]
    Refenes A. N., Eberbach E., McCabe S. C., and Treleaven P. C.: “PARLE: A Parallel Target Language for Integrating Symbolic and Numeric Processing”, Proc.Conf.on Parallel Architectures and Languages Europe PARLE 89, Lecture Notes in Computer Science 366, Springer-Verlag, Eindhoven, The Netherlands, (1989), vol.II, 181–198.Google Scholar
  22. [22]
    Tomayko J.E.: Software Requirements Specification for the Cost-Driven Machine for Software Reallocation; Boeing Military Airplanes and the Wichita State University, 1989.Google Scholar
  23. [23]
    Tomayko J.E., Eberbach E.: Applying Formal Methods and Proofs to the Verification of Distributed Systems, unpublished manuscript, Wichita and London, 1989.Google Scholar
  24. [24]
    Treleaven P. C., et al: Computer Architectures for Artificial Intelligence; in: Future Generation Computers, Lect.Notes in Computer Science, Springer-Verlag, vol.272, 1986, 416–492.Google Scholar
  25. [25]
    Wirth N.: The programming language PASCAL; Acta Informatica 1, 1 (1971), 35–63.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Eugeniusz Eberbach
    • 1
  1. 1.Jodrey School of Computer ScienceAcadia UniversityWolfvilleCanada

Personalised recommendations