WIT Press

The Calculus Of Self-modifiable Algorithms: Planning, Scheduling And Automated Programming Application

Price

Free (open access)

Paper DOI

10.2495/AI950091

Volume

10

Pages

8

Published

1995

Size

814 kb

Author(s)

E. Eberbach

Abstract

It is clearly an important endeavor to introduce rigorous mathematical formalisms into AI in order to more clearly see the potential and limitations of certain ap- proaches. Showing similarities between approaches can also be highly beneficial. In this paper we present a Calculus of Self-modifiable Algorithms, which was de- signed to be a universal approach to parallel and intelligent systems, integrating various styles of programming and applied to a wealth of domains of future gener- ation computers. The formal basis of the approach is outlined, the optimization inference engine is described, and the application to planning, scheduling and automated programming is presented. 1 Introduction Providing a mathematical foundation for the study of self-modifiable algorith

Keywords